Contributions to pairing-based cryptography

Summary

It is shown that pairings can be used to construct efficient and provably secure digital signature schemes, and the first convertible undeniable signatures without random oracles are given, and a new signature primitive called concinnous signatures is constructed, designed to facilitate fair exchange of digital signatures without any trusted third party.

Keywords

Key escrow, Cryptography, Theoretical computer science, Computer science, Escrow

References

Securing Threshold Cryptosystems against Chosen Ciphertext AttackVictor Shoup, Rosario Gennaro — 1998
Lower bounds for non-black-box zero knowledgeBoaz Barak, Yehuda Lindell, Salil Vadhan — 2003
Modern Cryptography: Theory and PracticeWenbo Mao — 2003
A tapestry of identity-based encryption: practical frameworks comparedXavier Boyen — 2008
DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATIONM. O. Rabin — 1979
Fair exchange with a semi-trusted third party (extended abstract)Matthew Franklin, Michael K. Reiter — 1997
Fairness in electronic commerceN. Asokan — 1998
A New Traitor TracingShigeo Mitsunari, Ryuichi Sakai, Masao Kasahara — 2002
New Explicit Conditions of Elliptic Curve Traces for FR-ReductionAtsuko Miyaji, Masaki Nakabayashi, Shunzou Takano — 2001
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete LogarithmsUeli Maurer, Stefan Wolf — 1999
Enabling Confidentiality in Content-Based Publish/Subscribe InfrastructuresCostin Raiciu, David S. Rosenblum — 2006
How to exchange (secret) keysManuel Blum — 1983
New ID-based group signature from pairingsXiaofeng Chen, Fangguo Zhang, Kwangjo Kim — 2006
Universal one-way hash functions and their cryptographic applicationsMoni Naor, Moti Yung — 1989
A fully collusion resistant broadcast, trace, and revoke systemDan Boneh, Brent Waters — 2006
Scalable security and accounting services for content-based publish/subscribe systemsHimanshu Khurana — 2005
Ambiguous Optimistic Fair ExchangeQiong Huang, Guomin Yang, Duncan S. Wong — 2008
The Weil Pairing, and Its Efficient CalculationVictor S. Miller — 2004
Elliptic Curves Suitable for Pairing Based CryptographyFriederike Brezing, Annegret Weng — 2005
A method for obtaining digital signatures and public-key cryptosystemsRonald L. Rivest, Adi Shamir, Leonard M. Adleman — 1978

Cited by

Group key establishment protocols: Pairing cryptography and verifiable secret sharing schemeRabia Aslanoğlu — 2013

Related papers

Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing SchemesJan Camenisch, Ivan Damgård — 2000
Advances in cryptology - EUROCRYPT 2004 : International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004 : proceedingsChristian Cachin, Jan Camenisch — 2004
Hierarchical Identity-Based (Lossy) Trapdoor FunctionsAlex Escala, Javier Herranz, Benoît Libert — 2012
Stronger security notions for trapdoor functions and applicationsAlexandra Boldyreva, Adam O’Neill — 2010
Public-Key Cryptography: Design and AlgorithmicFabien Laguillaumie — 2011
The Exact Security of Pairing Based Encryption and Signature SchemesDavid Galindo — 2004
Function-Private Subspace-Membership Encryption and Its ApplicationsDan Boneh, Ananth Raghunathan, Gil Segev — 2013