Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions

DOI10.1007/978-3-642-40041-4_31MaRDI QIDQ2845695zbMATH OpenOpenAlexWikidataFDO

Authors Eike Kiltz, Krzysztof Pietrzak, Mario Szegedy

Publication date 2 September 2013

Published in Advances in Cryptology – CRYPTO 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40041-4_31

zbMATH Keywords

additive combinatoricsCayley graphdigital signaturesFeistelindifferentiability

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient signatures on randomizable ciphertexts
• Signatures on randomizable ciphertexts
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Efficient Intrusion-Resilient Signatures Without Random Oracles
• A randomized analog of Chaum - van Antwerpen undeniable signature
• Short and efficient convertible undeniable signature schemes without random oracles
• Efficient digital signatures from RSA without random oracles
• Practical verifiably encrypted signatures without random oracles
• (Convertible) Undeniable Signatures Without Random Oracles
• Convertible and selectively convertible undeniable signature schemes

Cited in

(8)

• Regular lossy functions and their applications in leakage-resilient cryptography
• Minimizing the two-round Even-Mansour cipher
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• On the XOR of multiple random permutations
• Short Signatures in the Random Oracle Model
• Proofs of Catalytic Space
• Tight security for key-alternating ciphers with correlated sub-keys
• Open problems in hash function security

This page was built for publication: Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions

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