Oblivious transfer with access control

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2009, Pages 131-140

  Camenisch, Jan ^a   Dubovitskaya, Maria ^b   Neven, Gregory ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b NATIONAL RESEARCH NUCLEAR UNIVERSITY MEPHI   (Russian Federation)

Author keywords

Anonymous credentials; Oblivious transfer; Privacy

Indexed keywords

ANONYMOUS CREDENTIAL; AUTHORIZED USERS; DIFFIE HELLMAN; DIFFIE-HELLMAN ASSUMPTION; OBLIVIOUS TRANSFER; RANDOM ORACLE; THE STANDARD MODEL; USER ACCESS; USER NEED;

ACCESS CONTROL; CRYPTOGRAPHY; DATABASE SYSTEMS; NETWORK PROTOCOLS; SECURITY SYSTEMS;

NETWORK SECURITY;

EID: 74049137084     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1653662.1653679     Document Type: Conference Paper

References (34)

1. W. Aiello, Y. Ishai, O. Reingold. Priced oblivious transfer: How to sell digital goods. In EUROCRYPT 2001, LNCS vol. 2045, 119-135. Springer, 2001.
2. M. H. Au, W. Susilo, Y. Mu. Constant-size dynamic k-TAA. In SCN 06, LNCS vol. 4116, 111-125. Springer, 2006.
3. M. Bellare, O. Goldreich. On defining proofs of knowledge. In CRYPTO'92, LNCS vol. 740, 390-420. Springer, 1993.
4. D. Boneh, X. Boyen. Short signatures without random oracles. In EUROCRYPT 2004, LNCS vol. 3027, 56-73. Springer, 2004.
5. D. Boneh, X. Boyen, H. Shacham. Short group signatures. In CRYPTO 2004, LNCS vol. 3152, 41-55. Springer, 2004.
6. D. Boneh, C. Gentry, B. Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys. In CRYPTO 2005, LNCS vol. 3621, 258-275. Springer, 2005.
7. S. Brands. Rapid demonstration of linear relations connected by boolean operators. In EUROCRYPT '97, LNCS vol. 1233, 318-333. Springer, 1997.
8. S. Brands. Rethinking Public Key Infrastructure and Digital Certificates - Building in Privacy. Ph.D. thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999.
9. J. Camenisch, M. Dubovitskaya, G. Neven. Oblivious transfer with access control. Cryptology ePrint Archive, 2009.
10. J. Camenisch, A. Kiayias, M. Yung. On the portability of generalized Schnorr proofs. In EUROCRYPT 2009, LNCS vol. 5479, 425-442. Springer, 2009.
11. J. Camenisch, A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT 2001, LNCS vol. 2045, 93-118. Springer, 2001.
12. J. Camenisch, A. Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In CRYPTO 2004, LNCS vol. 3152, 56-72. Springer, 2004.
13. J. Camenisch, M. Michels. Proving in zero-knowledge that a number n is the product of two safe primes. In EUROCRYPT '99, LNCS vol. 1592, 107-122. Springer, 1999.
14. J. Camenisch, G. Neven, abhi shelat. Simulatable adaptive oblivious transfer. In EUROCRYPT 2007, LNCS vol. 4515, 573-590. Springer, 2007.
15. J. Camenisch, M. Stadler. Efficient group signature schemes for large groups. In CRYPTO '97, LNCS vol. 1296, 410-424. Springer, 1997.
16. J. L. Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. Ph.D. thesis, ETH Zürich, 1998. Diss. ETH No. 12520, Hartung Gorre Verlag, Konstanz.
17. R. Canetti. Studies in Secure Multiparty Computation and Applications. Ph.D. thesis, Weizmann Institute of Science, Rehovot 76100, Israel, 1995.
18. R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
19. D. Chaum. Security without identification: transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, 1985.
20. D. Chaum, J.-H. Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In CRYPTO'86, LNCS vol. 263, 118-167. Springer, 1987.
21. D. Chaum, T. P. Pedersen. Wallet databases with observers. In CRYPTO '92, LNCS vol. 740, 89-105. Springer-Verlag, 1993.
22. L. Chen. Access with pseudonyms. In Proceedings of the International Conference on Cryptography: Policy and Algorithms, 232-243. Springer, 1995.
23. S. Coull, M. Green, S. Hohenberger. Controlling access to an oblivious database using stateful anonymous credentials. Cryptology ePrint Archive, Report 2008/474, 2008.
24. R. Cramer, I. Damgård, P. D. MacKenzie. Efficient zero-knowledge proofs of knowledge without intractability assumptions. In PKC 2000, LNCS vol. 1751, 354-372. Springer, 2000.
25. R. Cramer, I. Damgård, B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO '94, LNCS vol. 839, 174-187. Springer, 1994.
26. I. Damgård. Payment systems and credential mechanisms with provable security against abuse by individuals. In CRYPTO'88, LNCS vol. 403, 328-335. Springer, 1990.
27. G. Di Crescenzo, R. Ostrovsky, S. Rajagopalan. Conditional oblivious transfer and timed-release encryption. In EUROCRYPT'99, LNCS vol. 1592, 74-89. Springer, 1999.
28. Y. Dodis, A. Yampolskiy. A verifiable random function with short proofs and keys. In Public Key Cryptography - PKC 2005, LNCS vol. 3386, 416-431. Springer, 2005.
29. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469-472, 1985.
30. J. Herranz. Restricted adaptive oblivious transfer. Cryptology ePrint Archive, Report 2008/182, 2008.
31. A. Lysyanskaya, R. Rivest, A. Sahai, S. Wolf. Pseudonym systems. In Selected Areas in Cryptography, LNCS vol. 1758. Springer, 1999.
32. B. Pfitzmann, M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM Conference on Computer and Communications Security, 245-254. ACM press, 2000.
33. B. Pfitzmann, M. Waidner. A model for asynchronous reactive systems and its application to secure message transmission. In Proceedings of the IEEE Symposium on Research in Security and Privacy, 184-200. IEEE Computer Society, IEEE Computer Society Press, 2001.
34. C. P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.