An Identity Escrow Scheme with Appointed Verifiers

Camenisch, Jan; Lysyanskaya, Anna

doi:10.1007/3-540-44647-8_23

Cited by 30 publications

(23 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it is not hard to see how to add revocation for other schemes and systems that use some form of anonymous credentials (e.g., [5,11,12,10,13,21,23]). …”

Section: Revocation Of Anonymous Credentialsmentioning

confidence: 99%

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

Camenisch¹,

Lysyanskaya²

2002

Lecture Notes in Computer Science

Self Cite

544

494

View full text Add to dashboard Cite

Abstract.We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to hash a large set of inputs into one short value, such that there is a short proof that a given input was incorporated into this value. A dynamic accumulator allows one to dynamically add and delete a value, such that the cost of an add or delete is independent of the number of accumulated values. We provide a construction of a dynamic accumulator and an efficient zero-knowledge proof of knowledge of an accumulated value. We prove their security under the strong RSA assumption. We then show that our construction of dynamic accumulators enables efficient revocation of anonymous credentials, and membership revocation for recent group signature and identity escrow schemes.

show abstract

“…However, it is not hard to see how to add revocation for other schemes and systems that use some form of anonymous credentials (e.g., [5,11,12,10,13,21,23]). …”

Section: Revocation Of Anonymous Credentialsmentioning

confidence: 99%

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

Camenisch¹,

Lysyanskaya²

2002

Lecture Notes in Computer Science

Self Cite

544

494

View full text Add to dashboard Cite

show abstract

“…Although there have been methods proposed to reduce the round complexity of zero-knowledge proofs and the design of non-interactive zero-knowledge proofs, most protocols that use such methods require us to accept a weaker form of security [8]. In this paper we focus on applications of interactive zero-knowledge proofs in verifiable group encryption and a specific application of verifiable encryption: fair exchange of signatures.…”

Section: Cryptographic Protocolsmentioning

confidence: 99%

Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology

Tate

Vishwanathan

2009

Data and Applications Security XXIII

View full text Add to dashboard Cite

Abstract. Cut-and-choose is used in interactive zero-knowledge protocols in which a prover answers a series of random challenges that establish with high probability that the prover is honestly following the defined protocol. In this paper, we examine one such protocol and explore the consequences of replacing the statistical trust gained from cut-and-choose with a level of trust that depends on the use of secure, trusted hardware. As a result, previous interactive protocols with multiple rounds can be improved to non-interactive protocols with computational requirements equivalent to a single round of the original protocol. Surprisingly, we accomplish this goal by using hardware that is not designed for our applications, but rather simply provides a generic operation that we call "certified randomness," which produces a one-way image of a random value along with an encrypted version that is signed by the hardware to indicate that these values are properly produced. It is important to stress that while we use this operation to improve cut-and-choose protocols, the trusted operation does not depend in any way on the particular protocol or even data used in the protocol: it operates only with random data that it generates. This functionality can be achieved with minor extensions to the standard Trusted Platform Modules (TPMs) that are being used in many current systems.We demonstrate our technique through application to cut-and-choose protocols for verifiable group encryption and optimistic fair exchange. In both cases we can remove or drastically reduce the amount of interaction required, as well as decrease the computational requirements significantly.

show abstract

“…[Leighton 1994;Micali 1993]). The idea can also be traced in group signature schemes and anonymous credential systems, which are mechanisms which can be used to offer identity escrow [Camenisch and Lysyanskaya 2001;2004;Camenisch and Shoup 2003;Kiayias and Yung 2004]. Clearly, the systems break down if a single escrow agent (known as group manager or issuer ) holds the escrowed identity and he is dishonest -he can reveal Alice's identity even if the agreed conditions for doing so have not been met.…”

Section: Introductionmentioning

confidence: 99%

Identity Escrow Protocol and Anonymity Analysis in the Applied Pi-Calculus

Mukhamedov

Ryan

2010

ACM Trans. Inf. Syst. Secur.

View full text Add to dashboard Cite

Anonymity with identity escrow attempts to allow users of an on-line service to remain anonymous, while providing the possibility that the service owner can break the anonymity in exceptional circumstances, such as to assist in a criminal investigation. In the paper, we propose an identity escrow protocol that distributes user identity among several escrow agents. The main feature of our scheme is it is based on standard encryption algorithms and it provides user anonymity even if all but one escrow holders are dishonest acting in a coalition. We also present analysis of the anonymity property of our protocol in the applied pi calculus. We review a related scheme by Marshall and Molina-Jiminez that aimed to achieve goals similar to ours, and show that their scheme suffers from serious weaknesses.

show abstract

An Identity Escrow Scheme with Appointed Verifiers

Cited by 30 publications

References 36 publications

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials

Improving Cut-and-Choose in Verifiable Encryption and Fair Exchange Protocols Using Trusted Computing Technology

Identity Escrow Protocol and Anonymity Analysis in the Applied Pi-Calculus

Contact Info

Product

Resources

About