Secret-key zero-knowlegde and non-interactive verifiable exponentiation

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

Volumn 2951, Issue , 2004, Pages 223-237

  Cramer, Ronald ^a   Damgård, Ivan ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; NETWORK SECURITY;

ALTERNATIVE SOLUTIONS; COMMON REFERENCE STRING; DISCRETE LOGARITHMS; NON-INTERACTIVE ZERO KNOWLEDGE; PSEUDO-RANDOM FUNCTIONS; RANDOM ORACLE MODEL; THRESHOLD CRYPTOGRAPHY; UNDENIABLE SIGNATURE;

CRYPTOGRAPHY;

EID: 26844542405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_13     Document Type: Article

References (15)

1. Ronald Cramer, Victor Shoup: Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. Proc. of EUROCRYPT 2002: 45-64, Springer Verlag LNCS.
2. David Chaum, Hans Van Antwerpen: Undeniable Signatures. Proc. of CRYPTO 1989, Springer Verlag LNCS. pp.212-217.
3. Ivan Damgard, Eiichiro Fujisaki: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. Proc. of ASIACRYPT 2002:125-142, Springer Verlag LNCS.
4. Fabrice Boudot: Efficient Proofs that a Committed Number Lies in an Interval. Proc. of EUROCRYPT 2000: 431-444, Springer Verlag LNCS.
5. Anna Lysyanskaya: Unique Signatures and Verifiable Random Functions from the DH-DDH Separation. Proc. of CRYPTO 2002: 597-612, Springer Verlag LNCS.
6. Ivan Damgård, Mads Jurik: Client/Server Tradeoffs for Online Elections. Proc. of Public Key Cryptography 2002: 125-140. Springer Verlag LNCS.
7. Ivan Damgard and Jesper Nielsen: Efficient Universally Composable Multiparty Computation, proc. of Crypto 03, Springer Verlag LNCS.
8. Yevgeniy Dodis: Efficient Construction of (Distributed) Verifiable Random Functions, Proc. of PKC 2002, Springer Verlag LNCS.
9. Rosario Gennaro, Tal Rabin, Hugo Krawczyk: RSA-Based Undeniable Signatures. Journal of Cryptology 13(4): 397-416 (2000).
10. Silvio Micali, Michael O. Rabin, Salil P. Vadhan: Verifiable Random Functions. Proc. of IEEE FOCS 1999: 120-130.
11. Moni Naor, Omer Reingold: Number-theoretic Constructions of Efficient Pseudorandom Functions. Proc. of IEEE FOCS 1997: 458-467.
12. Jesper Buus Nielsen: A Threshold Pseudorandom Function Construction and Its Applications. Proc. of CRYPTO 2002: 401-416. Springer Verlag LNCS.
13. Pascal Paillier: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. Proc. of EUROCRYPT 1999: 223-238, Springer Verlag LNCS.
14. Ran Canetti: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1): 143-202 (2000).
15. Victor Shoup: Practical Threshold Signatures. Proc. of EUROCRYPT 2000: 207220, Springer Verlag LNCS