Impossibility of blind signatures from one-way permutations

DOI10.1007/978-3-642-19571-6_37MaRDI QIDQ3000567zbMATH OpenOpenAlexFDO

Authors Dominique Schröder, Arkady Yerukhimovich, Jonathan Katz

Publication date 19 May 2011

Published in Theory of Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the impossibility of three-move blind signature schemes
• scientific article; zbMATH DE number 1088232
• Information and Communications Security
• Security in Communication Networks
• scientific article; zbMATH DE number 4185033

Cited in

(8)

• Lattice-based blind signatures, revisited
• Black-box use of one-way functions is useless for optimal fair coin-tossing
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• On the impossibility of three-move blind signature schemes
• Lower bounds on the efficiency of encryption and digital signature schemes
• Information and Communications Security
• Topics in Cryptology – CT-RSA 2006
• Communication lower bounds of key-agreement protocols via density increment arguments

This page was built for publication: Impossibility of blind signatures from one-way permutations

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