On robust combiners for oblivious transfer and other primitives (2005)

by Danny Harnik , Joe Kilian , Moni Naor , Omer Reingold , Alon Rosen
Venue:In Proc. Eurocrypt ’05
Citations:29 - 1 self

Documents Related by Co-Citation

11 On tolerant cryptographic constructions – A Herzberg - 2005
133 One-way functions and pseudorandom generators – L A Levin - 1985
13 On robust combiners for private information retrieval and other primitives – Remo Meier, Bartosz Przydatek - 2006
35 Chosen-Ciphertext Security of Multiple Encryption – Yevgeniy Dodis, Jonathan Katz - 2005
11 An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems – Charles Asmuth, G R Blakely - 1981
9 A complete public-key cryptosystem – Dima Grigoriev, Edward A. Hirsch, Konstantin Pervyshev
15 On the impossibility of efficiently combining collision resistant hash functions – Dan Boneh, Xavier Boyen - 2006
109 Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) – Claude Crépeau, Joe Kilian - 1988
298 How to exchange secrets by oblivious transfer – M Rabin - 1981
469 A randomized protocol for signing contracts – Michael Ben-or, Oded Goldreich, Silvio Micali, Ronald, L. Rivest - 1985
213 How to break MD5 and other hash functions – Xiaoyun Wang, Hongbo Yu - 2005
29 On the power of cascade ciphers – S Even, O Goldreich - 1985
25 How to Securely Outsource Cryptographic Computations – Susan Hohenberger, Anna Lysyanskaya
5 Robuster Combiners for Oblivious Transfer – Remo Meier, Bartosz Przydatek, Jürg Wullschleger
230 Founding cryptography on oblivious transfer – J Kilian - 1988
5 On the logical complexity of symmetric switching functions in monotone and complete bases – E A Lamagna, J E Savage - 1973
33 A Boolean Function Requiring 3n Network Size,” Theoret – N Blum - 1984
349 The Complexity of Boolean Functions – Ingo Wegener - 1987
79 The Complexity of Computing – J E Savage - 1976