Abstract
An identity escrow scheme allows a member of a group to prove membership in this group without revealing any extra information. At the same time, in case of abuse, his identity can still be discovered. Such a scheme allows anonymous access control. In this paper, we put forward the notion of an identity escrow scheme with appointed verifiers. Such a scheme allows the user to only convince an appointed verifier (or several appointed verifiers) of his membership; but no unauthorized verifier can verify a user’s group membership even if the user fully cooperates, unless the user is completely under his control. We provide a formal definition of this new notion and give an efficient construction of an identity escrow scheme with appointed verifiers provably secure under common number-theoretic assumptions in the public-key model.
Chapter PDF
Similar content being viewed by others
References
N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):591–610, 2000.
G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO 2000, vol. 1880 of LNCS, pp. 255–270. Springer Verlag, 2000.
N. Barić and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In EUROCRYPT’ 97, vol. 1233 of LNCS, pp. 480–494.
M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In EUROCRYPT’ 98, vol. 1403 of LNCS, pp. 236–250. Springer Verlag, 1998.
J. C. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections (extended abstract). In Proc. 26th STOC, pp. 544–553. ACM, 1994.
S. Brands. Untraceable off-line cash in wallets with observers. In CRYPTO’ 93, vol. 773 of LNCS, pp. 302–318, 1993.
J. Camenisch. Efficient anonymous fingerprinting with group signatures. In ASIACRYPT 2000, vol. 1976 of LNCS, pp. 415–428. Springer Verlag, 2000.
J. Camenisch and I. Damgård. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In ASIACRYPT 2000, vol. 1976 of LNCS, pp. 331–345, 2000.
J. Camenisch and A. Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In EUROCRYPT 2001, vol. 2045 of LNCS, pp. 93–118. Springer Verlag, 2001.
J. Camenisch and A. Lysyanskaya. An identity escrow scheme with appointed verifiers. http://eprint.iacr.org/2001, 2001.
J. Camenisch and M. Michels. A group signature scheme with improved efficiency. In ASIACRYPT’ 98, vol. 1514 of LNCS, pp. 160–174. Springer Verlag, 1998.
J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In CRYPTO’ 97, vol. 1296 of LNCS, pp. 410–424. Springer Verlag, 1997.
R. Canetti. Studies in Secure Multiparty Computation and Applications. PhD thesis, Weizmann Institute of Science, Rehovot 76100, Israel, June 1995.
R. Canetti. Security and composition of multi-party cryptographic protocols. Journal of Cryptology, 13(1):143–202, 2000.
D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, February 1981.
D. Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030–1044, Oct. 1985.
D. Chaum. Designated confirmer signatures. In EUROCRYPT’ 94, vol. 950 of LNCS, pp. 86–91. Springer Verlag Berlin, 1994.
D. Chaum, A. Fiat, and M. Naor. Untraceable electronic cash. In CRYPTO’ 88, vol. 403 of LNCS, pp. 319–327. Springer Verlag, 1990.
D. Chaum and E. van Heyst. Group signatures. In EUROCRYPT’ 91, vol. 547 of LNCS, pp. 257–265. Springer-Verlag, 1991.
L. Chen and T. P. Pedersen. New group signature schemes. In EUROCRYPT’ 94, vol. 950 of LNCS, pp. 171–181. Springer-Verlag, 1995.
R. Cramer, I. Damgård, and J. B. Nielsen. Multiparty computation from threshold homomorphic encryption. Manuscript. Available from http://eprint.iacr.org.
R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In CRYPTO’ 98, vol. 1642 of LNCS, pp. 13–25, Berlin, 1998. Springer Verlag.
R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM CCS, pp. 46–52. ACM press, nov 1999.
I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In EUROCRYPT 2000, vol. 1807 of LNCS, pp. 431–444. Springer Verlag, 2000.
C. Dwork and A. Sahai. Concurrrent zero-knowledge: Reducing the need for timing constraints. In CRYPTO’ 98, vol. 1642 of LNCS, pp. 105–120, 1998.
A. Fiat and A. Shamir. How to prove yourself: Practical solution to identification and signature problems. In CRYPTO’ 86, vol. 263 of LNCS, pp. 186–194, 1987.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO’ 97, vol. 1294 of LNCS, pp. 16–30, 1997.
R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In EUROCRYPT’ 99, vol. 1592 of LNCS, pp. 123–139, 1999.
D. M. Goldschlag, M. G. Reed, and P. F. Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM, 42(2):84–88, 1999.
M. Hirt and K. Sako. Efficient receipt-free voting based on homomorphic encryption. In EUROCRYPT 2000, vol. 1807 of LNCS, pp. 539–556, 2000.
M. Jakobsson, K. Sako, and R. Impagliazzo. Designated verifier proofs and their applications. In EUROCRYPT’ 96, vol. 1233 of LNCS, 1996.
J. Kilian and E. Petrank. Identity escrow. In CRYPTO’ 98, vol. 1642 of LNCS, pp. 169–185, Berlin, 1998. Springer Verlag.
A. Lysyanskaya and Z. Ramzan. Group blind digital signatures: A scalable solution to electronic cash. In Proc. Financial Cryptography, 1998.
T. Okamoto and S. Uchiyama A new public-key cryptosystem as secure as factoring. In EUROCRYPT’ 98, vol. 1403 of LNCS, pp. 308–318, 1998.
P. Paillier. Public-key cryptosystems based on composite residuosity classes. In EUROCRYPT’ 99, vol. 1592 of LNCS, pp. 223–239. Springer Verlag, 1999.
T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO’ 91, vol. 576 of LNCS, pp. 129–140. Springer Verlag, 1992.
B. Pfitzmann and M. Waidner. Composition and integrity preservation of secure reactive systems. In Proc. 7th ACM CCS, pp. 245–254. ACM press, nov 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Camenisch, J., Lysyanskaya, A. (2001). An Identity Escrow Scheme with Appointed Verifiers. In: Kilian, J. (eds) Advances in Cryptology — CRYPTO 2001. CRYPTO 2001. Lecture Notes in Computer Science, vol 2139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44647-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-44647-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42456-7
Online ISBN: 978-3-540-44647-7
eBook Packages: Springer Book Archive