Jan Camenisch, Victor Shoup  Home/Search
Context Related
| ibm.com/~jca/papers/verenc.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ibm.com/~jca/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper addresses the problem of designing practical protocols for proving properties about encrypted data. To this end, it presents a variant of the new public key encryption of Cramer and Shoup based on Paillier's decision composite residuosity assumption, along with e#cient protocols for verifiable encryption and decryption of discrete logarithms (and more generally, of representations with respect to multiple bases). This is the first verifiable encryption system that provides... (Update)
Cited by: More
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006) (Correct)
The Fairness of Perfect Concurrent Signatures - Guilin Wang Feng (2006) (Correct)
Testing Disjointness of Private Datasets - Aggelos Kiayias And (2005) (Correct)
Similar documents (at the sentence level):
23.3%: Practical Verifiable Encryption and Decryption of Discrete.. - Camenisch, Shoup (2002) (Correct)
Active bibliography (related documents): More All
1.1: Verifiable Encryption, Group Encryption, and Their.. - Camenisch, Damgård (2000) (Correct)
0.4: A Signature Scheme with Efficient Protocols - Camenisch, Lysyanskaya (2002) (Correct)
0.4: Compact E-Cash - Camenisch, Hohenberger, Lysyanskaya (2005) (Correct)
Similar documents based on text: More All
0.2: Proof Systems for General Statements about Discrete Logarithms - Camenisch, Stadler (1997) (Correct)
0.2: Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1998) (Correct)
0.1: Proving in Zero-Knowledge that a Number is the Product of.. - Camenisch, Michels (1999) (Correct)
Related documents from co-citation: More All
10: How to prove yourself: Practical solutions to identification and signature probl.. - Fiat, Shamir - 1987
9: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
8: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure publi.. - Cramer, Shoup
BibTeX entry: (Update)
J. Camenisch and V. Shoup. Practical Verifiable Encryption and Decryption of Discrete Logarithms. Adv. in Cryptology --- Crypto 2003, LNCS vol. 2729, Springer-Verlag, pp. 126--144, 2003. http://citeseer.ist.psu.edu/camenisch03practical.html More
@misc{ camenisch03practical,
author = "J. Camenisch and V. Shoup",
title = "Practical Verifiable Encryption and Decryption of Discrete Logarithms",
text = "J. Camenisch and V. Shoup. Practical Verifiable Encryption and Decryption
of Discrete Logarithms. Adv. in Cryptology --- Crypto 2003, LNCS vol. 2729,
Springer-Verlag, pp. 126--144, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/camenisch03practical.html" }
Citations (may not include all citations):411 How to prove yourself: Practical solutions to identification.. - Fiat, Shamir - 1987
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998
187 Security without identification: Transaction systems to make.. (context) - Chaum - 1985
159 Non-interactive and information-theoretic secure verifiable .. (context) - Pedersen - 1992
119 Proofs of partial knowledge and simplified design of witness.. - Cramer, Damgard et al. - 1994
105 Secure hash-and-sign signatures without the random oracle - Gennaro, Halevi et al. - 1999
103 Statistical zero knowledge protocols to prove modular polyno.. (context) - Fujisaki, Okamoto - 1997
101 Collision-free accumulators and fail-stop signature schemes .. - Baric, Pfitzmann - 1997
100 Optimistic protocols for fair exchange - Asokan, Schunter et al.
93 A practical and provably secure coalition-resistant group si.. - Ateniese, Camenisch et al.
92 Signature schemes based on the strong RSA assumption - Cramer, Shoup - 2000
65 Securing threshold cryptosystems against chosen ciphertext a.. - Shoup, Gennaro - 1998
63 Publicly verifiable secret sharing - Stadler - 1996
56 cient group signature schemes for large groups (context) - Camenisch, Stadler - 1997
56 Universally composable commitments - Canetti, Fischlin
54 Easy come -- easy go divisible cash - Chan, Frankel et al. - 1998
48 Universal hash proofs and a paradigm for adaptive chosen cip.. - Cramer, Shoup
47 A group signature scheme with improved e#ciency (context) - Camenisch, Michels - 1998
27 ciency for generic group signature schemes (context) - Camenisch, Michels - 1999
27 cient proofs that a committed number lies in an interval (context) - Boudot
23 Advances in Cryptology --- CRYPTO (context) - Chaum, Pedersen et al. - 1993
20 A framework for password-based authenticated key exchange - Gennaro, Lindell
19 Advances in Cryptology --- EUROCRYPT (context) - Chaum, signatures - 1994
18 cient non-transferable anonymous multi-show credential syste.. (context) - Camenisch, Lysyanskaya
17 cient and practical fair exchange protocols with o#- line TT.. (context) - Bao, Deng et al. - 1998
17 Digital payment systems enabling security and unobservabilit.. (context) - Burk, Pfitzmann - 1990
17 Advances in Cryptology: EUROCRYPT (context) - Poupard, Stern et al.
14 Design and implementation of the idemix anonymous credential.. - Camenisch, Van Herreweghen - 2002
14 cient concurrent zero-knowledge in the auxiliary string mode.. (context) - Damgard
13 Proving in zero-knowledge that a number n is the product of .. (context) - Camenisch, Michels - 1999
12 Public-key cryptosystems based on composite residuosity clas.. (context) - Paillier - 1999
12 cient threshold public key cryptosystem secure against adapt.. (context) - Canetti, Goldwasser - 1999
11 Advances in Cryptology --- CRYPTO (context) - Kilian, Petrank et al. - 1998
11 Auto-recoverable auto-certifiable cryptosystems (context) - Young, Young - 1998
10 and their applications to group signatures and signature sha.. (context) - Camenisch, Damgard et al.
9 Communications on Pure and Applied Mathematics (context) - Rabin, Shallit et al. - 1986
7 Confirmer signature schemes secure against adaptive adversar.. - Camenisch, Michels
7 An integer commitment scheme based on groups with hidden ord.. (context) - Damgard, Fujisaki
5 Generic constructions for secure and e#cient confirmer signa.. (context) - Michels, Stadler - 1998
3 Advances in Cryptology --- EUROCRYPT (context) - An, Dodis et al.
3 th Annual ACM Symposium on Theory of Computing (context) - Dwork, Naor et al. - 1998
3 Proofs of knowledge for non-monotone discrete-log formulae a.. - Bresson, Stern
2 cient certificate revocation and certified e-mail with trans.. (context) - Micali - 1997
2 cient and secure protocols for verifiable signature sharing .. (context) - Catalano, Gennaro - 1998
1 MIT Laboratory for Computer Science (context) - Bellare, Goldwasser et al. - 1996
1 st Annual ACM Symposium on Theory of Computing (context) - Canetti, Goldreich et al. - 2000
1 Advances in Cryptology --- EUROCRYPT (context) - Franklin, Reiter et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.zurich.ibm.com/~jca/publications.html): More
Efficient Anonymous Fingerprinting with Group Signatures.. - Camenisch (2000) (Correct)
Confirmer Signature Schemes Secure against Adaptive Adversaries - Camenisch, Michels (2000) (Correct)
Separability and Efficiency for Generic Group Signature Schemes - Camenisch, Michels (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC