The Chaining Lemma and its application

DOI10.1007/978-3-319-17470-9_11MaRDI QIDQ2947530zbMATH OpenOpenAlexFDO

Authors Sebastian Faust, Pratyay Mukherjee, D. 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

Mathematics Subject Classification ID

Information theory (general) (94A15) Cryptography (94A60)

Recommendations

• A better chain rule for HILL pseudoentropy -- beyond bounded leakage
• Cryptography with tamperable and leaky memory
• A counterexample to the chain rule for conditional HILL entropy
• The chain rule for HILL pseudoentropy, revisited
• Modulus computational entropy

Cites work

• scientific article; zbMATH DE number 2009976 (Why is no real title available?)
• A tamper and leakage resilient von Neumann architecture
• BiTR: built-in tamper resilience
• Bounded tamper resilience: how to go beyond the algebraic barrier
• Capacity of non-malleable codes
• Continuous non-malleable codes
• Continuous non-malleable key derivation and its application to related-key security
• Correlated-input secure hash functions
• Cryptography secure against related-key attacks and tampering
• Cryptography with tamperable and leaky memory
• Efficient non-malleable codes and key-derivation for poly-size tampering circuits
• Explicit non-malleable codes against bit-wise tampering and permutations
• Fast Software Encryption
• From single-bit to multi-bit public-key encryption via non-malleable codes
• Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
• Non-Malleable Codes from Additive Combinatorics
• Non-malleable codes
• On the importance of eliminating errors in cryptographic computations
• Private Circuits II: Keeping Secrets in Tamperable Circuits
• Pseudorandom functions and permutations provably secure against related-key attacks
• Public Key Encryption against Related Key Attacks
• RKA security beyond the linear barrier: IBE, encryption and signatures
• Secure message authentication against related-key attack
• Securing circuits against constant-rate tampering
• Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
• Subspace LWE
• Tamper detection and continuous non-malleable codes
• Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
• The Chaining Lemma and its application
• Theory of Cryptography

Cited in

(14)

• Continuously non-malleable codes in the split-state model
• Subversion-resilient signatures: definitions, constructions and applications
• scientific article; zbMATH DE number 1843999 (Why is no real title available?)
• scientific article; zbMATH DE number 6052309 (Why is no real title available?)
• Efficient public-key cryptography with bounded leakage and tamper resilience
• The Planar Closing Lemma for Chain Recurrence
• Clar chains and a counterexample
• Moving lemma for K1 -chains
• Impossibility on tamper-resilient cryptography with uniqueness properties
• The Chaining Lemma and its application
• A Proof of Dilworth's Chain Decomposition Theorem
• Bounded tamper resilience: how to go beyond the algebraic barrier
• Chainability and Hemmingsen's theorem
• Non-malleable Codes with Split-State Refresh

This page was built for publication: The Chaining Lemma and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947530)