Share This Author
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
This paper proposes a practical anonymous credential system that is based on the strong RSA assumption and the decisional Diffie-Hellman assumption modulo a safe prime product and is considerably superior to existing ones.
A Signature Scheme with Efficient Protocols
This paper proposes a practical and provably secure signature scheme and shows protocols for issuing a signature on a committed value (so the signer has no information about the signed value), and for proving knowledge of a signing on a commit value.
Signature Schemes and Anonymous Credentials from Bilinear Maps
This work proposes a new and efficient signature scheme that is provably secure in the plain model and provides efficient protocols that allow one to prove in zero-knowledge the knowledge of a signature on a committed (or encrypted) message and to obtain a signatureon a committed message.
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
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.
How to Securely Outsource Cryptographic Computations
This work provides a formal security definition for securely outsourcing computations from a computationally limited device to an untrusted helper, and provides a framework for quantifying the efficiency and checkability of an outsourcing implementation.
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.
Sequential Aggregate Signatures from Trapdoor Permutations
This work proposes sequential aggregate signatures, in which the set of signers is ordered, and gives a construction in the random oracle model based on families of certified trapdoor permutations, and shows how to instantiate the scheme based on RSA.
Asynchronous verifiable secret sharing and proactive cryptosystems
- C. Cachin, K. Kursawe, Anna Lysyanskaya, R. Strobl
- Computer Science, MathematicsCCS '02
- 18 November 2002
The first practical verifiable secret sharing protocol for asynchronous networks is proposed, which yields the first asynchronous Byzantine agreement protocol in the standard model whose efficiency makes it suitable for use in practice.
On Signatures of Knowledge
The first delegatable anonymous credential system is obtained, i.e., a system in which one can use one's anonymous credentials as a secret key for issuing anonymous credentials to others, as a corollary of the traditional definition of digital signature schemes.
P-signatures and Noninteractive Anonymous Credentials
- Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya
- Computer Science, MathematicsTCC
- 19 March 2008
P-signatures enable, for the first time, the design of a practical non-interactive anonymous credential system whose security does not rely on the random oracle model and may serve as a useful building block for other privacy-preserving authentication mechanisms.