Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions

DOI10.1007/978-3-642-40041-4_31zbMath1310.94156OpenAlexW2162048617WikidataQ59163678 ScholiaQ59163678MaRDI QIDQ2845695

Eike Kiltz, Krzysztof Pietrzak

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

Cayley graphdigital signaturesindifferentiabilityadditive combinatoricsFeistel

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

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

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