Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
Alexandra Boldyreva,Craig Gentry,Adam O'Neill,Dae Hyun Yum +3 more
- 28 Oct 2007
- pp 276-285
TL;DR: In this paper, a new primitive called ordered multisignatures (OMS) is introduced, which allows signers to attest to a common message as well as the order in which they signed.
read more
Abstract: We construct new multiparty signature schemes that allow multiple signers to sequentially produce a compact, fixed-length signature simultaneously attesting to the message(s) they want to sign. First, we introduce a new primitive that we call ordered multisignatures (OMS), which allow signers to attest to a common message as well as the order in which they signed. Our OMS construction substantially improves computational efficiency over any existing scheme with comparable functionality. Second, we design a new identity-based sequential aggregate signature scheme, where signers can attest to different messages and signature verification does not require knowledge of traditional public keys. The latter property permits savings on bandwidth and storage as compared to public-key solutions. In contrast to the only prior scheme to provide this functionality, ours offers improved security that does not rely on synchronized clocks or a trusted first signer. Security proofs according to the corresponding security definitions and under appropriate computational assumptions are provided for all the proposed schemes. We give several applications of our schemes to secure network routing, and we believe that they will find many other applications as well.
read more
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
Aggregate message authentication codes
Jonathan Katz,Andrew Y. Lindell +1 more
- 08 Apr 2008
TL;DR: In this article, the authors investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender.
Compact Multi-signatures for Smaller Blockchains
Dan Boneh,Manu Drijvers,Gregory Neven +2 more
- 02 Dec 2018
TL;DR: The paper gives new constructions that are derived from Schnorr signatures and from BLS signatures that provide new functionality and are designed to reduce the size of the Bitcoin blockchain, but are useful in many other settings where multi-signatures are needed.
261
An efficient certificateless aggregate signature with constant pairing computations
TL;DR: The security of the proposed scheme can be proved to be equivalent to the standard computational Diffie-Hellman problem in the random oracle with a tight reduction and the scheme does not require synchronization for aggregating randomness, which makes it more suitable for ad hoc networks.
181
Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing
Alexandra Boldyreva,Craig Gentry,Adam O'Neill,Dae Hyun Yum +3 more
- 28 Oct 2007
TL;DR: In this paper, a new primitive called ordered multisignatures (OMS) is introduced, which allows signers to attest to a common message as well as the order in which they signed.
170
Secure and Privacy Preserving Protocol for Cloud-Based Vehicular DTNs
TL;DR: A novel threshold credit-based incentive mechanism (TCBI) is proposed based on the modified model of population dynamics to efficiently resist the node compromise attacks, stimulate the cooperation among intermediate nodes, maximize vehicular nodes' interest, and realize the fairness of possessing the same opportunity of transmitting packets for credits.
144
References
Identity-based cryptosystems and signature schemes
Adi Shamir
- 23 Aug 1985
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.
Random oracles are practical: a paradigm for designing efficient protocols
Mihir Bellare,Phillip Rogaway +1 more
- 01 Dec 1993
TL;DR: It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
5.7K
Ciphertext-Policy Attribute-Based Encryption
John Bethencourt,Amit Sahai,Brent Waters +2 more
- 20 May 2007
TL;DR: A system for realizing complex access control on encrypted data that is conceptually closer to traditional access control methods such as role-based access control (RBAC) and secure against collusion attacks is presented.
Fast Probabilistic Algorithms for Verification of Polynomial Identities
TL;DR: Vanous fast probabdlsttc algonthms, with probability of correctness guaranteed a prion, are presented for testing polynomial ldentmes and propemes of systems of polynomials and ancdlary fast algorithms for calculating resultants and Sturm sequences are given.
Aggregate and verifiably encrypted signatures from bilinear maps
Dan Boneh,Craig Gentry,Ben Lynn,Hovav Shacham +3 more
- 04 May 2003
TL;DR: In this article, Boneh, Lynn, and Shacham introduced the concept of an aggregate signature, presented security models for such signatures, and gave several applications for aggregate signatures.