Simulatable adaptive oblivious transfer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4515 LNCS, Issue , 2007, Pages 573-590

  Camenisch, Jan ^a   Neven, Gregory ^b,c   Shelat, Abhi ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTER SIMULATION; MESSAGE PASSING; RANDOM PROCESSES; SECURITY OF DATA; SIGNAL RECEIVERS;

ADAPTIVE OBLIVIOUS TRANSFER; BLIND SIGNATURES; RECEIVER SECURITY;

DATA TRANSFER;

EID: 38049132285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_33     Document Type: Conference Paper

References (40)

1. W. Aiello, Y. Ishai, and O. Reingold. : Priced oblivious transfer: How to sell digital goods. In EUROCRYPT 2001, p. 119-135.
2. M. Abdalla, C. Namprempre, and G. Neven. On the (im)possibility of blind message authentication codes. In CT-RSA 2006, p. 262-279.
3. D. Boneh and X. Boyen. Short signatures without random oracles. In EUROCRYPT 2004, p. 56-73.
4. G. Brassard, C. Crépeau, and J.M. Robert. All-or-nothing disclosure of secrets. In CRYPTO'86, p. 234-238.
5. M. Bellare and O. Goldreich. On defining proofs of knowledge. In CRYPTO'92, p. 390-420.
6. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In CRYPTO'89, p. 547-557.
7. M. Bellare, C. Namprempre, D. Pointcheval, and M. Semanko. The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme. J. Cryptology, 16(3):185-215, 2003.
8. A. Boldyreva. Threshold signatures, multisignatures and blind signatures based on the gap-Diffie-Hellman-group signature scheme. In PKC 2003, p. 31-46.
9. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efficient protocols. In ACM CCS 93, p. 62-73.
10. R. Canetti. Security and composition of multi-party cryptographic protocols. J. Cryptology, 13(1):143-202, 2000.
11. R. Cramer, I. Damgård, and P. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In PKC 2000, p. 354-372.
12. D. Chaum. Blind signature systems. U.S. Patent #4,759,063, 1988.
13. C. Crépeau and J. Kilian. Weakening security assumptions and oblivious transfer. In CRYPTO'88, p. 2-7.
14. J. Camenisch and A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, p. 56-72.
15. J. Camenisch, G. Neven, and a. shelat. Simulatable Adaptive Oblivious Transfer. Cryptology ePrint Archive, 2007.
16. D. Catalano, D. Pointcheval, and T. Pornin. Trapdoor hard-to-invert group isomorphisms and their application to password-based authentication. To appear in J. Cryptology, 2007.
17. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO'97, p. 410-424.
18. C.-K. Chu and W.-G. Tzeng. Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries. In PKC 2005, p. 172-183.
19. C. Dwork, M. Naor, and A. Sahai. Concurrent zero-knowledge. J. ACM, 51(6):851-898, 2004.
20. Y. Dodis and A. Yampolskiy. A verifiable random function with short proofs and keys. In PKC 2005, p. 416-431.
21. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
22. T. ElGamal. A public key cryptosystem and signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31:469-472, 1985.
23. O. Goldreich. Foundations of Cryptography, Volume 2. Cambridge University Press, 2004.
24. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. In 19th ACM STOC, p. 218-229.
25. S. Goldwasser and R. Ostrovsky. Invariant signatures and non-interactive zero-knowledge proofs are equivalent. In CRYPTO'92, p. 228-245.
26. A. Juels, M. Luby, and R. Ostrovsky. Security of blind digital signatures (Extended abstract). In CRYPTO'97, p. 150-164.
27. Y. Kalai. Smooth projective hashing and two-message oblivious transfer. In EUROCRYPT 2005, p. 78-95.
28. S. Laur and H. Lipmaa. On security of sublinear oblivious transfer. Cryptology ePrint Archive, 2006.
29. D. Malkhi and Y. Sella. Oblivious transfer based on blind signatures. Technical Report 2003-31, Leibniz Center, Hebrew University, 2003.
30. S. Mitsunari, R. Sakai, and M. Kasahara. A new traitor tracing. IEICE Transactions Fundamentals, E85-A(2):481-84, 2002.
31. M. Naor and B. Pinkas. Oblivious transfer and polynomial evaluation. In 31st ACM STOC, p. 245-254, 1999.
32. M. Naor and B. Pinkas. Oblivious transfer with adaptive queries. In CRYPTO'99, p. 573-590.
33. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In 12th SODA, p. 448-457, 2001.
34. M. Naor and B. Pinkas. Computationally secure oblivious transfer. J. Cryptology, 18, 2005.
35. W. Ogata and K. Kurosawa. Oblivious keyword search. J. Complexity, 20(2-3):356-371, 2004.
36. T. Okamoto. Efficient blind and partially blind signatures without random oracles. In TCC 2006, LNCS, p. 80-99.
37. W. Ogata and R. Sasahara. k out of n oblivious transfer without random oracles. IEICE Transactions, 87-A(1):147-151, 2004.
38. D. Pointcheval and J. Stern. Security proofs for signature schemes. In EUROCRYPT'96, p. 387-398.
39. M. Rabin. How to exchange secrets by oblivious transfer. Technical Report TR-81, Harvard Aiken Computation Laboratory, 1981.
40. S. Wiesner. Conjugate Coding. SIGACT News, 15, 1983. . 78-88.