Impossibility of blind signatures from one-way permutations

DOI10.1007/978-3-642-19571-6_37zbMATH Open1290.94152OpenAlexW1571706060MaRDI QIDQ3000567FDOQ3000567

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

Recommendations

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

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cited In (8)

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

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)