Book ChapterDOI
Short Group Signatures
Dan Boneh,Xavier Boyen,Hovav Shacham +2 more
- pp 41-55
Reads0
Chats0
TLDR
In this article, the authors proposed a group signature scheme based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption.Abstract:
We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption. We prove security of our system, in the random oracle model, using a variant of the security definition for group signatures recently given by Bellare, Micciancio, and Warinschi.read more
Citations
More filters
Posted Content
Hierarchical Identity Based Encryption with Constant Size Ciphertext.
TL;DR: In this paper, a Hierarchical Identity Based Encryption (HIBE) scheme is presented, where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, regardless of the hierarchy depth.
Book ChapterDOI
Signature Schemes and Anonymous Credentials from Bilinear Maps
Jan Camenisch,Anna Lysyanskaya +1 more
TL;DR: 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.
Book ChapterDOI
Hierarchical identity based encryption with constant size ciphertext
TL;DR: In this article, a Hierarchical Identity Based Encryption (HIBE) scheme is presented, where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, regardless of the hierarchy depth.
Book ChapterDOI
Predicate encryption supporting disjunctions, polynomial equations, and inner products
TL;DR: This work constructs a scheme for predicates corresponding to the evaluation of inner products over ZN (for some large integer N) that enables constructions in which predicates correspond to the Evaluation of disjunctions, polynomials, CNF/DNF formulae, or threshold predicates.
Book ChapterDOI
Short Signatures Without Random Oracles
Dan Boneh,Xavier Boyen +1 more
TL;DR: The Strong Diffie-Hellman assumption has been used in this article to construct a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles.
References
More filters
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.
Journal ArticleDOI
Efficient signature generation by smart cards
TL;DR: An efficient algorithm that preprocesses the exponentiation of a random residue modulo p is presented, which improves the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures.
Journal ArticleDOI
Security Arguments for Digital Signatures and Blind Signatures
David Pointcheval,Jacques Stern +1 more
TL;DR: It is proved that a very slight variation of the well-known El Gamal signature scheme resists existential forgeries even against an adaptively chosen-message attack and an appropriate notion of security related to the setting of electronic cash is defined.
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.
Book ChapterDOI
Lower bounds for discrete logarithms and related problems
TL;DR: Lower bounds on the complexity of the discrete logarithm and related problems are proved that match the known upper bounds: any generic algorithm must perform Ω(p1/2) group operations, where p is the largest prime dividing the order of the group.