Open AccessPosted Content
Pairing-Based Cryptographic Protocols : A Survey.
TL;DR: In this article, the authors have tried to cover different cryptographic protocols based on bilinear pairings which possess, to the best of our knowledge, proper security proofs in the existing security models.
read more
Abstract: The bilinear pairing such as Weil pairing or Tate pairing on elliptic and hyperelliptic curves have recently been found applications in design of cryptographic protocols. In this survey, we have tried to cover different cryptographic protocols based on bilinear pairings which possess, to the best of our knowledge, proper security proofs in the existing security models.
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
A verifiable random function with short proofs and keys
Yevgeniy Dodis,Aleksandr Yampolskiy +1 more
- 23 Jan 2005
TL;DR: In this paper, a verifiable random function (VRF) on bilinear groups is presented, which avoids using an inefficient Goldreich-Levin transformation, thereby saving several factors in security.
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
TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs (CMU-CyLab-08-011)
Ahren Studer,Elaine Shi,Fan Bai,Adrian Perrig +3 more
- 01 Jan 2008
TL;DR: In this paper, a VANET key management scheme based on Temporary Anonymous Certified Keys (TACKs) is proposed to provide timely revocation of misbehaving participants while maintaining the same or less overhead for vehicle-to-vehicle communication as the IEEE 1609.2 standard.
236
ARSA: An Attack-Resilient Security Architecture for Multihop Wireless Mesh Networks
Yanchao Zhang,Yuguang Fang +1 more
TL;DR: This paper thoroughly identifies the unique security requirements of WMNs and proposes ARSA, an attack-resilient security architecture for WMNs that eliminates the need for establishing bilateral roaming agreements and having real-time interactions between potentially numerous WMN operators.
Aggregated path authentication for efficient BGP security
Meiyuan Zhao,Sean W. Smith,David M. Nicol +2 more
- 07 Nov 2005
TL;DR: This paper proposes six constructions for aggregated path authentication that substantially improve efficiency of S-BGP's path authentication on both speed and space criteria and shows that the new schemes achieve such an efficiency that they may overcome the space obstacles and provide a real-world practical solution for BGP security.
References
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
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.
Identity-Based Encryption from the Weil Pairing
Dan Boneh,Matthew K. Franklin +1 more
TL;DR: This work proposes a fully functional identity-based encryption (IBE) scheme based on bilinear maps between groups and gives precise definitions for secure IBE schemes and gives several applications for such systems.
Short Signatures from the Weil Pairing
Dan Boneh,Ben Lynn,Hovav Shacham +2 more
- 09 Dec 2001
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.
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.
Related Papers (5)
Dan Boneh,Matthew K. Franklin +1 more
- 19 Aug 2001
Adi Shamir
- 23 Aug 1985
Dan Boneh,Ben Lynn,Hovav Shacham +2 more
- 09 Dec 2001
Antoine Joux
- 02 Jul 2000