The Chaining Lemma and Its Application
From MaRDI portal
Publication:2947530
DOI10.1007/978-3-319-17470-9_11zbMath1375.94081OpenAlexW2105978202MaRDI QIDQ2947530
Pratyay Mukherjee, Sebastian Faust, Daniele Venturi, Ivan B. Damgård
Publication date: 24 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17470-9_11
Related Items (7)
The Chaining Lemma and Its Application ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ Continuously non-malleable codes in the split-state model ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Non-malleable Codes with Split-State Refresh ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties
Cites Work
- Unnamed Item
- Non-malleable coding against bit-wise and split-state tampering
- Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier
- Subspace LWE
- Public Key Encryption against Related Key Attacks
- Securing Circuits against Constant-Rate Tampering
- Continuous Non-malleable Key Derivation and Its Application to Related-Key Security
- A Tamper and Leakage Resilient von Neumann Architecture
- Secure Message Authentication Against Related-Key Attack
- The Chaining Lemma and Its Application
- Capacity of non-malleable codes
- Correlated-Input Secure Hash Functions
- Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
- Cryptography Secure against Related-Key Attacks and Tampering
- BiTR: Built-in Tamper Resilience
- Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
- Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
- Private Circuits II: Keeping Secrets in Tamperable Circuits
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Non-Malleable Codes
- Non-Malleable Codes from Additive Combinatorics
- RKA Security beyond the Linear Barrier: IBE, Encryption and Signatures
- Cryptography with Tamperable and Leaky Memory
- Tamper Detection and Continuous Non-malleable Codes
- From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes
- Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits
- Fast Software Encryption
- Continuous Non-malleable Codes
- Securing Circuits and Protocols against 1/poly(k) Tampering Rate
- Theory of Cryptography
- On the importance of eliminating errors in cryptographic computations
This page was built for publication: The Chaining Lemma and Its Application
