(Enter summary)
Abstract: We generalize and improve the security and efficiency of the verifiable encryption
scheme of Asokan et al., such that it can rely on more general assumptions,
and can be proven secure without assuming random oracles. We show a
new application of verifiable encryption to group signatures with separability,
these schemes do not need special purpose keys but can work with a wide range
of signature, identification, and encryption schemes already in use. Finally, we
extend our basic primitive... (Update)
Cited by: More
A Practical and Provably Secure - Coalition-Resistant Group Signature
(Correct)
A Practical and Provably Secure Coalition-Resistant.. - Ateniese.. (2000)
(Correct)
Fair Exchange - Pagnia, Vogt, Gärtner (2003)
(Correct)
Similar documents (at the sentence level):
38.1%: Verifiable Encryption, Group Encryption, and Their.. - Camenisch, Damgård (2000)
(Correct)
Active bibliography (related documents): More All
2.1: Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1998)
(Correct)
0.4: A Group Signature Scheme Based on an RSA-Variant - Camenisch, Michels (1998)
(Correct)
0.2: An Identity Escrow Scheme with Appointed Verifiers - Camenisch, Lysyanskaya (2001)
(Correct)
Similar documents based on text: More All
0.5: Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable.. - Burmester
(Correct)
0.3: Equivocally Verifiable Encryptions and Its Applications - Kim, Park, Won (1997)
(Correct)
0.3: Publicly Verifiable Partial Key Escrow - Mao (1997)
(Correct)
Related documents from co-citation: More All
13: Optimistic fair exchange of digital signatures
- Asokan, Shoup - 1998
9: cient group signature schemes for large groups (context) - Camenisch, Stadler
9: Group signatures (context) - Chaum, van Heijst - 1992
BibTeX entry: (Update)
J. Camenisch and I. Damgard. Verifiable encryption and applications to group signatures and signature sharing. Technical Report RS-98-32, BRICS, Department of Computer Science, University of Aarhus, Dec. 1998. http://citeseer.ist.psu.edu/camenisch99verifiable.html More
@misc{ camenisch98verifiable,
author = "J. Camenisch and I. Damgard",
title = "Verifiable encryption and applications to group signatures and signature
sharing",
text = "J. Camenisch and I. Damgard. Verifiable encryption and applications to
group signatures and signature sharing. Technical Report RS-98-32, BRICS,
Department of Computer Science, University of Aarhus, Dec. 1998.",
year = "1998",
url = "citeseer.ist.psu.edu/camenisch99verifiable.html" }
Citations (may not include all citations):
645
How to share a secret (context) - Shamir - 1979
411
How to prove yourself: Practical solution to identification ..
- Fiat, Shamir - 1987
404
Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
206
Zero-knowledge proofs of identity (context) - Feige, Fiat et al. - 1988
154
Group signatures (context) - Chaum, van Heyst - 1991
131
Optimistic fair exchange of digital signatures
- Asokan, Shoup et al. - 1998
122
A practical zero-knowledge protocol fitted to security micro.. (context) - Guillou, Quisquater - 1988
119
Proofs of partial knowledge and simplified design of witness..
- Cramer, Damgard et al. - 1994
94
Concurrent zero knowledge
- Dwork, Naor et al. - 1998
76
Identity escrow
- Kilian, Petrank - 1998
76
New group signature schemes (context) - Chen, Pedersen - 1995
74
Fair blind signatures
- Stadler, Piveteau et al. - 1995
68
Digital payment systems with passive anonymity-revoking trus..
- Camenisch, Maurer et al. - 1996
63
Publicly verifiable secret sharing
- Stadler - 1996
63
How to construct constant-round zero-knowledge proof systems..
- Goldreich, Kahan - 1996
55
The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
39
Efficient signature generation for smart cards (context) - Schnorr - 1991
35
Efficient group signature schemes for large groups
- Camenisch, Stadler - 1997
32
Threshold cryptography (context) - Desmedt, Frankel - 1990
28
How to convert any digital signature scheme into a group sig..
- Petersen - 1997
26
A group signature scheme with improved efficiency (context) - Camenisch, Michels - 1998
23
Efficient and generalized group signatures
- Camenisch - 1997
19
Indirect discourse proofs (context) - Frankel, Tsiounis et al. - 1996
16
Zero-knowledge proof for finite field arithmetic (context) - Cramer, Damgard - 1998
15
Modular Design of Secure yet Practical Cryptographic Protoco.. (context) - Cramer - 1997
9
Verifiable signature sharing (context) - Franklin, Reiter - 1995
8
Cryptographic Protocols for Revocable Privacy (context) - Stadler - 1996
6
New efficient and secure protocols for verifiable signature ..
- Catalano, Gennaro - 1998
5
Concurrrent zero-knowledge: Reducing the need for timing con.. (context) - Dwork, Sahai - 1998
2
the existance of bit commitment schemes and zeroknowledge pr.. (context) - Damgard - 1990
2
Efficient certificate revocation and certified e-mail with t.. (context) - Micali - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999)
(Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997)
(Correct)
Incoercible Multiparty Computation (Extended Abstract) - Canetti, Gennaro (1996)
(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