Open AccessPosted Content
An Integer Commitment Scheme based on Groups with Hidden Order.
Ivan Damgård,Eiichiro Fujisaki +1 more
113
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
Jan Camenisch,Anna Lysyanskaya +1 more
- 18 Aug 2002
TL;DR: This work provides a construction of a dynamic accumulator and an efficient zero-knowledge proof of knowledge of an accumulated value, and proves their security under the strong RSA assumption.
A signature scheme with efficient protocols
Jan Camenisch,Anna Lysyanskaya +1 more
- 11 Sep 2002
TL;DR: The anonymous credential system of Camenisch and Lysyanskaya as discussed by the authors is a generalization of the anonymous credential scheme of the original anonymous signature scheme and is a building block for anonymity-enhancing cryptographic systems, such as electronic cash, group signatures and anonymous credential systems.
Compact e-cash
Jan Camenisch,Susan Hohenberger,Anna Lysyanskaya +2 more
- 22 May 2005
TL;DR: This paper presents efficient off-line anonymous e-cash schemes where a user can withdraw a wallet containing 2 coins each of which she can spend unlinkably, and offers exculpability of users, that is, the bank can prove to third parties that a user has double-spent.
•Posted Content
Practical Verifiable Encryption and Decryption of Discrete Logarithms.
Jan Camenisch,Victor Shoup +1 more
TL;DR: The first verifiable encryption scheme that provides chosen ciphertext security and avoids inecient cut-and-choose proofs was proposed in this paper, based on Paillier's decision composite residuosity assumption.
322
TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs
Ahren Studer,Elaine Shi,Fan Bai,Adrian Perrig +3 more
- 22 Jun 2009
TL;DR: This work proposes a VANET key management scheme based on Temporary Anonymous Certified Keys (TACKs), which efficiently prevents eavesdroppers from linking a vehicle's different keys and provides timely revocation of misbehaving participants while maintaining the same or less overhead for vehicle-to-vehicle communication as the current IEEE 1609.2 standard.
291
References
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
Torben P. Pedersen
- 11 Aug 1991
TL;DR: It is shown how to distribute a secret to n persons such that each person can verify that he has received correct information about the secret without talking with other persons.
2.9K
A new public-key cryptosystem as secure as factoring
Tatsuaki Okamoto,Shigenori Uchiyama +1 more
- 31 May 1998
TL;DR: In this paper, the authors proposed a probabilistic public-key cryptosystem which is provably secure under the p-subgroup assumption, which is comparable to the quadratic residue and higher degree residue assumptions.
•Journal Article
Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations
TL;DR: In this paper, a bit commitment scheme, BC(.), and efficient statistical zero knowledge (SZK) protocols are proposed, in which, for any given multi-variable polynomial f(X 1,...,X t ) and any given modulus n, prover P gives (I 1,..,I t ) to verifier V and can convince V that P knows (x 1,...,x t ) satisfying f(x 1,...x t ), 0 (mod n) and I i = BC(x i ), (i = 1
432
Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
Ronald Cramer,Ivan Damgård +1 more
TL;DR: It is shown that Shamirs (Shens) interactive proof system for the (IP-complete) QBF problem can be transformed to a zero-knowledge proof system with the same asymptotic communication complexity and number of rounds.
Efficient proofs that a committed number lies in an interval
Fabrice Boudot
- 14 May 2000
TL;DR: This paper presents a new proof, which is both efficient and exact, for proving that a committed number lies in a specific interval.