Search the dblp DataBase
Claude Crépeau :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Claude Crépeau , Carlton R. Davis , Muthucumaru Maheswaran A Secure MANET Routing Protocol with Resilience against Byzantine Behaviours of Malicious or Selfish Nodes. [Citation Graph (0, 0)][DBLP ] AINA Workshops (2), 2007, pp:19-26 [Conf ] Charles H. Bennett , Gilles Brassard , Claude Crépeau , Marie-Hélène Skubiszewska Practical Quantum Oblivious Transfer. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1991, pp:351-366 [Conf ] Pierre Beauchemin , Gilles Brassard , Claude Crépeau Two Observations on Probabilistic Primality Testing. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1986, pp:443-450 [Conf ] David Chaum , Claude Crépeau , Ivan Damgård Multiparty Unconditionally Secure Protocols (Abstract). [Citation Graph (0, 0)][DBLP ] CRYPTO, 1987, pp:462- [Conf ] Gilles Brassard , Claude Crépeau Zero-Knowledge Simulation of Boolean Circuits. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1986, pp:223-233 [Conf ] Gilles Brassard , Claude Crépeau Quantum Bit Commitment and Coin Tossing Protocols. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1990, pp:49-61 [Conf ] Gilles Brassard , Claude Crépeau , Jean-Marc Robert All-or-Nothing Disclosure of Secrets. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1986, pp:234-238 [Conf ] Claude Crépeau A Secure Poker Protocol that Minimizes the Effect of Player Coalitions. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1985, pp:73-86 [Conf ] Claude Crépeau A Zero-Knowledge Poker Protocol That Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1986, pp:239-247 [Conf ] Claude Crépeau Equivalence Between Two Flavours of Oblivious Transfers. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1987, pp:350-354 [Conf ] Claude Crépeau , Jeroen van de Graaf , Alain Tapp Committed Oblivious Transfer and Private Multi-Party Computation. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1995, pp:110-123 [Conf ] Claude Crépeau , Joe Kilian Weakening Security Assumptions and Oblivious Transfer (Abstract). [Citation Graph (0, 0)][DBLP ] CRYPTO, 1988, pp:2-7 [Conf ] Claude Crépeau , Joe Kilian Discreet Solitary Games. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1993, pp:319-330 [Conf ] Claude Crépeau , Alain Slakmon Simple Backdoors for RSA Key Generation. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2003, pp:403-416 [Conf ] Gilles Brassard , Claude Crépeau Sorting out Zero-Knowledge. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1989, pp:181-191 [Conf ] Gilles Brassard , Claude Crépeau Oblivious Transfers and Privacy Amplification. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:334-347 [Conf ] Gilles Brassard , Claude Crépeau , Moti Yung Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract). [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1989, pp:192-195 [Conf ] Claude Crépeau Verifiable Disclosure of Secrets and Applications (Abstract). [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1989, pp:150-154 [Conf ] Claude Crépeau Efficient Cryptographic Protocols Based on Noisy Channels. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1997, pp:306-317 [Conf ] Claude Crépeau , Daniel Gottesman , Adam Smith Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2005, pp:285-301 [Conf ] Claude Crépeau , Frédéric Légaré , Louis Salvail How to Convert the Flavor of a Quantum Bit Commitment. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2001, pp:60-77 [Conf ] Claude Crépeau , George Savvides Optimal Reductions Between Oblivious Transfers Using Interactive Hashing. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2006, pp:201-221 [Conf ] Claude Crépeau , Miklos Santha On the Reversibility of Oblivious Transfer. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1991, pp:106-113 [Conf ] Claude Crépeau , Louis Salvail Quantum Oblivious Mutual Identification. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 1995, pp:133-146 [Conf ] Claude Crépeau , George Savvides , Christian Schaffner , Jürg Wullschleger Information-Theoretic Conditions for Two-Party Secure Function Evaluation. [Citation Graph (0, 0)][DBLP ] EUROCRYPT, 2006, pp:538-554 [Conf ] Howard Barnum , Claude Crépeau , Daniel Gottesman , Adam Smith , Alain Tapp Authentication of Quantum Messages. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:449-458 [Conf ] Gilles Brassard , Claude Crépeau Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond [Citation Graph (0, 0)][DBLP ] FOCS, 1986, pp:188-195 [Conf ] Gilles Brassard , Claude Crépeau , Richard Jozsa , Denis Langlois A Quantum Bit Commitment Scheme Provably Unbreakable by both Parties [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:362-371 [Conf ] Gilles Brassard , Claude Crépeau , Jean-Marc Robert Information Theoretic Reductions among Disclosure Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1986, pp:168-173 [Conf ] Christian Cachin , Claude Crépeau , Julien Marcil Oblivious Transfer with a Memory-Bounded Receiver. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:493-502 [Conf ] Claude Crépeau , Joe Kilian Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1988, pp:42-52 [Conf ] Michael Ben-Or , Claude Crépeau , Daniel Gottesman , Avinatan Hassidim , Adam Smith Secure Multiparty Quantum Computation with (Only) a Strict Honest Majority. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:249-260 [Conf ] Gilles Brassard , Claude Crépeau , Moti Yung Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds. [Citation Graph (0, 0)][DBLP ] ICALP, 1989, pp:123-136 [Conf ] Claude Crépeau , Carlton R. Davis A certificate revocation scheme for wireless ad hoc networks. [Citation Graph (0, 0)][DBLP ] SASN, 2003, pp:54-61 [Conf ] Claude Crépeau , Kirill Morozov , Stefan Wolf Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel. [Citation Graph (0, 0)][DBLP ] SCN, 2004, pp:47-59 [Conf ] Gilles Brassard , Claude Crépeau , Sophie Laplante , Christian Léger Computationally Convincing Proofs of Knowledge. [Citation Graph (0, 0)][DBLP ] STACS, 1991, pp:251-262 [Conf ] David Chaum , Claude Crépeau , Ivan Damgård Multiparty Unconditionally Secure Protocols (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1988, pp:11-19 [Conf ] Claude Crépeau , Daniel Gottesman , Adam Smith Secure multi-party quantum computation. [Citation Graph (0, 0)][DBLP ] STOC, 2002, pp:643-652 [Conf ] Claude Crépeau , Paul Dumais , Dominic Mayers , Louis Salvail Computational Collapse of Quantum State with Application to Oblivious Transfer. [Citation Graph (0, 0)][DBLP ] TCC, 2004, pp:374-393 [Conf ] Howard Barnum , Claude Crépeau , Daniel Gottesman , Adam Smith , Alain Tapp Authentication of Quantum Messages [Citation Graph (0, 0)][DBLP ] CoRR, 2002, v:0, n:, pp:- [Journal ] Gilles Brassard , David Chaum , Claude Crépeau Minimum Disclosure Proofs of Knowledge. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1988, v:37, n:2, pp:156-189 [Journal ] Pierre Beauchemin , Gilles Brassard , Claude Crépeau , Claude Goutier , Carl Pomerance The Generation of Random Numbers that Are Probably Prime. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 1988, v:1, n:1, pp:53-64 [Journal ] Gilles Brassard , Claude Crépeau , Stefan Wolf Oblivious Transfers and Privacy Amplification. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 2003, v:16, n:4, pp:219-237 [Journal ] Claude Crépeau Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP ] J. Cryptology, 1996, v:9, n:3, pp:127-128 [Journal ] Gilles Brassard , Claude Crépeau , Moti Yung Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1991, v:84, n:1, pp:23-52 [Journal ] Charles H. Bennett , Gilles Brassard , Claude Crépeau , Ueli M. Maurer Generalized privacy amplification. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1915-1923 [Journal ] Gilles Brassard , Claude Crépeau , Miklos Santha Oblivious transfers and intersecting codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:1769-1780 [Journal ] Claude Crépeau , Daniel Gottesman , Adam Smith Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes [Citation Graph (0, 0)][DBLP ] CoRR, 2005, v:0, n:, pp:- [Journal ] Statistical Security Conditions for Two-Party Secure Function Evaluation. [Citation Graph (, )][DBLP ] Interactive Hashing: An Information Theoretic Tool (Invited Talk). [Citation Graph (, )][DBLP ] A localized certificate revocation scheme for mobile ad hoc networks. [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.007secs