Book ChapterDOI
Accumulators from bilinear pairings and applications
Lan Nguyen
- pp 275-292
Reads0
Chats0
TLDR
A dynamic accumulator scheme from bilinear pairings is proposed and used to construct an identity-based (ID-based) ring signature scheme with constant-size signatures and to provide membership revocation to group signature schemes, identity escrow schemes and anonymous credential systems.Abstract:
We propose a dynamic accumulator scheme from bilinear pairings and use it to construct an identity-based (ID-based) ring signature scheme with constant-size signatures and to provide membership revocation to group signature schemes, identity escrow schemes and anonymous credential systems. The ID-based ring signature scheme and the group signature scheme have very short signature sizes. The size of our group signatures with membership revocation is only half the size of those in the well-known ACJT00 scheme, which does not provide membership revocation. The schemes do not require trapdoor, so system parameters can be shared by multiple groups belonging to different organizations. All schemes are provably secure in formal models. We generalize the definition of accumulators and provide formal models for ID-based ad-hoc anonymous identification schemes and identity escrow schemes with membership revocation.read more
Citations
More filters
Proceedings ArticleDOI
Zerocoin: Anonymous Distributed E-Cash from Bitcoin
TL;DR: Zerocoin is proposed, a cryptographic extension to Bitcoin that augments the protocol to allow for fully anonymous currency transactions and uses standard cryptographic assumptions and does not introduce new trusted parties or otherwise change the security model of Bitcoin.
Book ChapterDOI
Constant-size commitments to polynomials and their applications
TL;DR: The polynomial commitment schemes are useful tools to reduce the communication cost in cryptographic protocols and are applied to four problems in cryptography: verifiable secret sharing, zero-knowledge sets, credentials and content extraction signatures.
Book ChapterDOI
Verifiable delegation of computation over large datasets
TL;DR: In this article, the problem of computing on large datasets that are stored on an untrusted server was studied, and the first practical verifiable computation scheme for high degree polynomial functions was presented.
Journal ArticleDOI
Verifiable Computation over Large Database with Incremental Updates
TL;DR: A general Inc-VDB framework is proposed by incorporating the primitive of vector commitment and the encrypt-then-incremental MAC mode of encryption and it is proved that the construction can achieve the desired security properties.
Book ChapterDOI
Vector Commitments and Their Applications
Dario Catalano,Dario Fiore +1 more
TL;DR: The study of a new primitive that allows to commit to an ordered sequence of q values in such a way that one can later open the commitment at specific positions (e.g., prove that mi is the i-th committed message).
References
More filters
Book ChapterDOI
Identity-based cryptosystems and signature schemes
TL;DR: In this article, the authors introduce a novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other's signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party.
Book ChapterDOI
How to prove yourself: practical solutions to identification and signature problems
Amos Fiat,Adi Shamir +1 more
TL;DR: Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described.
Book ChapterDOI
Short Signatures from the Weil Pairing
Dan Boneh,Ben Lynn,Hovav Shacham +2 more
TL;DR: A short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyperelliptic curves is introduced, designed for systems where signatures are typed in by a human or signatures are sent over a low-bandwidth channel.
Book ChapterDOI
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The first secure IBE scheme without random oracles was presented in this article, where the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively.
Proceedings Article
Group signatures
David Chaum,Eugène van Heyst +1 more
TL;DR: A new type of signature for a group of persons, called a group signature, which has the following properties: only members of the group can sign messages; and if necessary, the signature can be "opened", so that the person who signed the message is revealed.