Non-malleable functions and their applications
From MaRDI portal
Publication:2121503
DOI10.1007/s00145-022-09422-6zbMath1486.94086OpenAlexW4220854474MaRDI QIDQ2121503
Jiang Zhang, Yi Deng, Baodong Qin, Sherman S. M. Chow, Yu Chen
Publication date: 4 April 2022
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-022-09422-6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The discrete logarithm modulo a composite hides \(O(n)\) bits
- Non-Malleable Functions and Their Applications
- RKA Secure PKE Based on the DDH and HR Assumptions
- Leakage-Resilient Chosen-Ciphertext Secure Public-Key Encryption from Hash Proof System and One-Time Lossy Filter
- Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
- Public Key Encryption against Related Key Attacks
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
- Correlated-Input Secure Hash Functions
- Expedient Non-malleability Notions for Hash Functions
- Cryptography Secure against Related-Key Attacks and Tampering
- On Related-Secret Pseudorandomness
- Related-Key Security for Hybrid Encryption
- Extractable Perfectly One-Way Functions
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
- Lossy trapdoor functions and their applications
- Adaptive Trapdoor Functions and Chosen-Ciphertext Security
- Efficient Chosen-Ciphertext Security via Extractable Hash Proofs
- 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
- Chosen-Ciphertext Security via Correlated Products
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Deterministic and Efficiently Searchable Encryption
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Foundations of Non-malleable Hash and One-Way Functions
- New directions in cryptography
- Nonmalleable Cryptography
- Non-Malleable Codes
- Overcoming Weak Expectations
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Tamper Detection and Continuous Non-malleable Codes
- Leakage-Flexible CCA-secure Public-Key Encryption: Simple Construction and Free of Pairing
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Factoring Polynomials Over Large Finite Fields
- Fast Software Encryption
- Continuous Non-malleable Codes
This page was built for publication: Non-malleable functions and their applications