Handcuffing big brother: An abuse-resilient transaction escrow scheme (extended abstract)

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

Volumn 3027, Issue , 2004, Pages 590-608

  Jarecki, Stanislaw ^a   Shmatikov, Vitaly ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

DDH ASSUMPTIONS; ELECTRONIC TRANSACTION; PRIVACY PRESERVING; PRIVATE KEY; RANDOM ORACLE MODEL; SEARCH WARRANT; VERIFIABLE RANDOM FUNCTION;

DATA PRIVACY;

EID: 35048900318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_35     Document Type: Article

References (28)

1. [ASW98] N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proc. IEEE Symposium on Security and Privacy, pages 86-99, 1998.
2. [BBDP01] M. Bellare, A. Boldyreva, A. Desai, and D. Pointcheval. Key-privacy in public-key encryption. In Proc. Asiacrypt '01, pages 566-582, 2001.
3. [BCOP03] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano. Searchable public key encryption. IACR 2003/195, 2003.
4. [Bon98] D. Boneh. The decisional Diffie-Hellman problem. In Proc. 3rd Algorithmic Number Theory Symposium, pages 48-63, 1998.
5. [BR93] M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. ACM Conference on Computer and Communications Security, pages 62-73, 1993.
6. [BR94] M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Proc. Eurocrypt '94, pages 92-111, 1994.
7. [CD00] J. Camenisch and I. Damgard. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In Proc. of Asiacrypt '00, pages 331-345, 2000.
8. [CKS00] C. Cachin, K. Kursawe, and V. Shoup. Random oracles in Constantinople. In Proc. of PODC '00, pages 123-132, 2000.
9. [CL01] J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Proc. Eurocrypt '01, pages 93-118, 2001.
10. [CL02] J. Camenish and A. Lysyanskaya. A signature scheme with efficient protocols. In Proc. SCN '02, pages 268-289, 2002.
11. [CM99] J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In Proc. Eurocrypt '99, pages 107-122, 1999.
12. [CP92] D. Chaum and T. Pedersen. Wallet databases with observers. In Proc. Crypto '92, pages 89-105, 1992.
13. [CS97] J. Camenisch and M. Stadier. Proof systems for general statements about discrete logarithms. Technical Report TR 260, ETH Zürich, March 1997.
14. [CS03] J. Camenisch and V. Shoup. Verifiable encryption and decryption of discrete logarithms. In Proc. of Crypto '03, pages 126-144, 2003.
15. [DF01] I. Damgard and E. Fujisaki. An integer commitment scheme based on groups with hidden order. IACR 2001/064, 2001.
16. [Dod03] Y. Dodis. Efficient construction of (distributed) verifiable random functions. In Proc. Public Key Cryptography '03, pages 1-17, 2003.
17. [Fel87] P. Feldman. A practical scheme for non-interactive verifiable secret sharing. In Proc. FOCS '87, pages 427-438, 1987.
18. [Fis99] M. Fischlin. Pseudorandom function tribe ensembles based on one-way permutations: improvements and applications. In Proc. Eurocrypt '99, pages 432-445, 1999.
19. [FO98] E. Fujisaki and T. Okamoto. A practical and porvably secure scheme for publicly verifiable secret sharing and its applications. In Proc. Eurocrypt '98, pages 32-46, 1998.
20. [GJKR99] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Proc. of Eurocrypt '99, pages 295-310, 1999.
21. [JS04] S. Jarecki and V. Shmatikov. Handcuffing Big Brother: An abuse-resilient transaction escrow scheme. IACR eprint, 2004.
22. [KL95] J. Kilian and F.T. Leighton. Fair cryptosystems revisited. In Proc. Crypto '95, pages 208-221, 1995.
23. [Lys02] A. Lysyanskaya. Unique signatures and verifiable random functions from the DH-DDH separation. In Proc. Crypto '02, pages 597-612, 2002.
24. [Mic92] S. Micali. Fair public-key cryptosystems. In Proc. Crypto '92, pages 113-138, 1992.
25. [MRV99] S. Micali, M. Rabin, and S. Vadhan. Verifiable random functions. In Proc. FOCS '99, pages 120-130, 1999.
26. [NPR99] M. Naor, B. Pinkas, and O. Reingold. Distributed pseudo-random functions and KDCs. In Proc. of Eurocrypt '99, pages 327-346, 1999.
27. [Sho01] V. Shoup. OAEP reconsidered. In Proc. of Crypto '01, pages 239-259, 2001.
28. [SWP00] D.X. Song, D. Wagner, and A. Perrig. Practical techniques for searches on encrypted data. In Proc. IEEE Symposium on Security and Privacy, pages 44-55, 2000.