Non-malleable Codes with Split-State Refresh
From MaRDI portal
Publication:5738791
DOI10.1007/978-3-662-54365-8_12zbMath1404.94065OpenAlexW2584715018MaRDI QIDQ5738791
Antonio Faonio, Jesper Buus Nielsen
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_12
Related Items (3)
Continuously non-malleable codes in the split-state model ⋮ Non-malleable Codes with Split-State Refresh ⋮ Continuously non-malleable codes with split-state refresh
Cites Work
- Unnamed Item
- Non-Malleable Functions and Their Applications
- Non-malleable Codes from Two-Source Extractors
- Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
- Tamper Resilient Circuits: The Adversary at the Gates
- Malleable Proof Systems and Applications
- Public Key Encryption against Related Key Attacks
- Tamper and Leakage Resilience in the Split-State Model
- Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
- The Chaining Lemma and Its Application
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience
- One-Time Computable Self-erasing Functions
- Correlated-Input Secure Hash Functions
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Cryptography Secure against Related-Key Attacks and Tampering
- On Related-Secret Pseudorandomness
- Related-Key Security for Hybrid Encryption
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Foundations of Non-malleable Hash and One-Way Functions
- Efficient Noninteractive Proof Systems for Bilinear Groups
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Non-malleable codes from additive combinatorics
- A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Locally Decodable and Updatable Non-malleable Codes and Their Applications
- Tamper Detection and Continuous Non-malleable Codes
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Storing Secrets on Continually Leaky Devices
- Fast Software Encryption
- Non-malleable Codes with Split-State Refresh
- Non-malleable Codes for Bounded Depth, Bounded Fan-In Circuits
- Continuous Non-malleable Codes
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate
- Public-Key Cryptosystems Resilient to Key Leakage
This page was built for publication: Non-malleable Codes with Split-State Refresh
