Unlinkable priced oblivious transfer with rechargeable wallets

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

Volumn 6052 LNCS, Issue , 2010, Pages 66-81

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

^a IBM RESEARCH ZURICH   (Switzerland)

^b IBM Systems and Technology Group   (Russian Federation)

^c NATIONAL RESEARCH NUCLEAR UNIVERSITY MEPHI   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ACCOUNT BALANCE; DATABASE RECORDS; OBLIVIOUS TRANSFER; OBLIVIOUS TRANSFER PROTOCOLS; RANDOM ORACLE; THE STANDARD MODEL;

CRYPTOGRAPHY; CUSTOMER SATISFACTION; DATABASE SYSTEMS; NETWORK PROTOCOLS; NETWORK SECURITY;

SALES;

EID: 77955331156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14577-3_8     Document Type: Conference Paper

References (29)

1. Aiello, W., Ishai, Y., Reingold, O.: Priced oblivious transfer: How to sell digital goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.2045, p. 119. Springer, Heidelberg (2001)
2. Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: ACM CCS 1997. ACM Press, New York (1997)
3. Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE JSAC 18(4), 593-610 (2000)
4. Au, M.H., Susilo, W., Mu, Y.: Constant-size dynamic k-TAA. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.4116, pp. 111-125. Springer, Heidelberg (2006)
5. Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.740, pp. 390-420. Springer, Heidelberg (1993)
6. Boneh, D., Boyen, X.: Short signatures without random oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.3027, pp. 56-73. Springer, Heidelberg (2004)
7. Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.3152, pp. 41-55. Springer, Heidelberg (2004)
8. Brands, S.: Rapid demonstration of linear relations connected by boolean operators. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.1233, pp. 318-333. Springer, Heidelberg (1997)
9. Camenisch, J., Chaabouni, R., Shelat, A.: Efficient protocols for set membership and range proofs. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.5350, pp. 234-252. Springer, Heidelberg (2008)
10. Camenisch, J., Dubovitskaya, M., Neven, G.: Oblivious transfer with access control. In: ACM CCS 2009. ACM Press, New York (2009)
11. Camenisch, J., Dubovitskaya, M., Neven, G.: Unlinkable Priced Oblivious transfer with Rechargeable Wallets. In: Cryptology ePrint Archive (2010)
12. Camenisch, J., Kiayias, A., Yung, M.: On the portability of generalized schnorr proofs. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.5479, pp. 425-442. Springer, Heidelberg (2010)
13. Camenisch, J., Lysyanskaya, A.: Signature schemes and anonymous credentials from bilinear maps. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.3152, pp. 56-72. Springer, Heidelberg (2004)
14. Camenisch, J., Michels, M.: Proving in zero-knowledge that a number n is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.1592, p. 107. Springer, Heidelberg (1999)
15. Camenisch, J., Neven, G., Shelat, A.: Simulatable adaptive oblivious transfer. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.4515, pp. 573-590. Springer, Heidelberg (2007)
16. Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.2729, pp. 126-144. Springer, Heidelberg (2003)
17. Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.1294, pp. 410-424. Springer, Heidelberg (1997)
18. Camenisch, J.: Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, Diss. ETH No.12520 (1998)
19. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: FOCS 2001. IEEE Computer Society Press, Los Alamitos (2001)
20. Chaum, D., Pedersen, T.P.:Wallet databases with observers. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.740, pp. 89-105. Springer, Heidelberg (1993)
21. Coull, S., Green, M., Hohenberger, S.: Controlling access to an oblivious database using stateful anonymous credentials. In: Jareck, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.5443, pp. 501-520. Springer, Heidelberg (2009)
22. Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.3386, pp. 416-431. Springer, Heidelberg (2005)
23. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31(4), 469-472 (1985)
24. Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: ACM STOC. ACM Press, New York (1998)
25. Pfitzmann, B., Waidner, M.: Composition and integrity preservation of secure reactive systems. In: ACM CCS 2000. ACM Press, New York (2000)
26. Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology 4(3), 239-252 (1991)
27. Tobias, C.: Practical oblivious transfer protocols. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol.2578, pp. 415-426. Springer, Heidelberg (2003)
28. Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: IEEE Symposium on Research in Security and Privacy. IEEE Computer Society Press, Los Alamitos (2001)
29. Rial,A.,Kohlweiss,M.,Preneel,B.: Universallycomposableadaptivepricedoblivious transfer. In:Shacham,H. (ed.) Pairing2009.LNCS, vol.5671, pp. 231-247.Springer,Heidelberg(2009)