Some key techniques on pairing vector spaces

DOI10.1007/978-3-642-21969-6_25MaRDI QIDQ3011929zbMATH OpenOpenAlexFDO

Authors Tatsuaki Okamoto, Katsuyuki Takashima

Publication date 29 June 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21969-6_25

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On pairing-based cryptosystems
• A brief history of pairings
• The realm of the pairings
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• An introduction to pairing-based cryptography

Cites work

• Efficient attribute-based signatures for non-monotone predicates in the standard model
• Fully secure functional encryption with general relations from the decisional linear assumption
• Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
• Hierarchical Predicate Encryption for Inner-Products
• Homomorphic Encryption and Signatures from Vector Decomposition

Cited in

(1)

• Identity-based matchmaking encryption from standard assumptions

This page was built for publication: Some key techniques on pairing vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011929)