Expedient Non-malleability Notions for Hash Functions
From MaRDI portal
Publication:3073712
DOI10.1007/978-3-642-19074-2_18zbMath1284.94050OpenAlexW1779218008MaRDI QIDQ3073712
Dominique Schröder, Paul Baecher, Marc Fischlin
Publication date: 11 February 2011
Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_18
Related Items (4)
Non-malleable functions and their applications ⋮ Toward RSA-OAEP Without Random Oracles ⋮ Witness authenticating NIZKs and applications ⋮ Another step towards realizing random oracles: non-malleable point obfuscation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New types of cryptanalytic attacks using related keys
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
- Extractable Perfectly One-Way Functions
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Non-interactive and reusable non-malleable commitment schemes
- New and improved constructions of non-malleable cryptographic protocols
- Concurrent Non-Malleable Zero Knowledge Proofs
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Adaptive One-Way Functions and Applications
- Non-malleable Obfuscation
- Foundations of Non-malleable Hash and One-Way Functions
- Nonmalleable Cryptography
- Non-malleability amplification
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Concurrent Non-malleable Commitments from Any One-Way Function
- Security of NMAC and HMAC Based on Non-malleability
- On the Security of OAEP
- Fast Software Encryption
- Mitigating Dictionary Attacks on Password-Protected Local Storage
This page was built for publication: Expedient Non-malleability Notions for Hash Functions
