Bilinear Groups of Composite Order

DOI10.1007/978-3-540-73489-5_1MaRDI QIDQ5429229zbMATH OpenOpenAlexFDO

Authors Dan Boneh

Publication date 29 November 2007

Published in Pairing-Based Cryptography – Pairing 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73489-5_1

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• A profitable sub-prime loan: obtaining the advantages of composite order in prime-order bilinear groups
• On the (Im)possibility of projecting property in prime-order setting
• Efficient noninteractive proof systems for bilinear groups
• Beyond the limitation of prime-order bilinear groups, and round optimal blind signatures

Cited in

(3)

• A profitable sub-prime loan: obtaining the advantages of composite order in prime-order bilinear groups
• On the (Im)possibility of projecting property in prime-order setting
• Tools over bilinear groups for modular design of cryptographic tasks. (Abstract)

This page was built for publication: Bilinear Groups of Composite Order

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