Hybrid trapdoor commitments and their applications

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 298-310

  Catalane, Dario ^a   Visconti, Ivan ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; POLYNOMIALS;

COMMITMENT PARAMETERS; TRAPDOOR COMMITMENT;

COMPUTER SCIENCE;

EID: 26444615154     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Damgard, I.: Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In: Advances in Cryptology - Eurocrypt '00. Volume 1807 of LNCS, Springer-Verlag (2000) 418-430
2. Gennaro, R.: Multi-trapdoor Commitments and Their Applications to Proofs of Knowledge Secure Under Concurrent Man-in-the-Middle Attacks. In: Advances in Cryptology - Crypto '04. Volume 3152 of LNCS, Springer-Verlag (2004) 220-236
3. MacKenzie, P., Yang, K.: On Simulation-Sound Trapdoor Commitments. In: Advances in Cryptology - Eurocrypt '04. Volume 3027 of LNCS, Springer-Verlag (2004) 382-400
4. Naor, M.: Bit Commitment Using Pseudorandomness. Journal of Cryptology 4 (1991) 151-158
5. Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology 9 (1996) 167-190
6. Damgård, I., Nielsen, J.B.: Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor. In: Advances in Cryptology - Crypto '02. Volume 2442 of LNCS, Springer-Verlag (2002) 581-596
7. Damgård, I., Groth, J.: Non interactive and reusable non-malleable commitments. In: 35th ACM Symposium on Theory of Computing, ACM (2003) 426-437
8. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In Stern, J., ed.: EUROCRYPT '99, Volume 1592 of LNCS, Springer-Verlag (1999) 223-238
9. Brassard, J., Chaum, D., Crepéau, C.: Minimum Disclosure Proofs of Knowledge. Journal of Computer and System Science 37 (1988) 156-189
10. Fortnow, L.: The Complexity of Perfect Zero-Knowledge. In: 19th ACM Symposium on Theory of Computing (STOC '87). (1987) 204-209
11. Boppana, R., Hastad, J., Zachos, S.: Does co-NP Have Short Interactive Proofs? Inf. Process. Lett. 25 (1987) 127-132
12. Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In Fumy, W., ed.: Advances in Cryptology - Eurocrypt '97. Volume 1223 of LNCS, Springer-Verlag (1997) 280-305
13. Rompel, J.: One-Way Functions are Necessary and Sufficient for Digital Signatures. In: 22nd ACM Symposium on Theory of Computing (STOC '90). (1990) 12-19
14. Goldwasser, S., Micali, S., Rivest, R.: A digital signature scheme secure against adaptive chosen message attacks. In: SIAM J. on Computing. Volume 17-(2). (1988) 281-308
15. Boneh, D., Boyen, X.: Short Signatures without Random Oracles. In: Advances in Cryptology - Eurocrypt '04. Volume 3027 of LNCS, Springer-Verlag (2004) 56-73
16. Cramer, R., Shoup, V.: Signature Schemes Based on the Strong RSA Assumption. In: 6th ACM Conference on Computer and Communications Security (CCS '99), ACM (1999)
17. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof-Systems. SIAM J. on Computing 18 (1989) 186-208
18. Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: 40th Symposium on Foundations of Computer Science, (FOCS '99), IEEE Computer Society Press (1999) 543-553
19. NIST: Digital Signature Standard (DSS). FIPS PUB 186 (1998)