Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures

DOI10.1007/978-3-642-17373-8_30zbMath1294.94064OpenAlexW2166904285MaRDI QIDQ3058676

Sarah Meiklejohn, David M. Freeman, Hovav Shacham

Publication date: 7 December 2010

Published in: Advances in Cryptology - ASIACRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17373-8_30

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Practical Round-Optimal Blind Signatures in the Standard Model ⋮ Dual System Encryption Framework in Prime-Order Groups via Computational Pair Encodings ⋮ Anonymous spatial encryption under affine space delegation functionality with full security ⋮ An algebraic framework for Diffie-Hellman assumptions ⋮ Converting pairing-based cryptosystems from composite to prime order setting -- a comparative analysis ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Efficient Round-Optimal Blind Signatures in the Standard Model

This page was built for publication: Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures