Non-malleable Codes with Split-State Refresh

DOI10.1007/978-3-662-54365-8_12MaRDI QIDQ5738791zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Continuously non-malleable codes with split-state refresh
• Continuously non-malleable codes with split-state refresh
• Continuously non-malleable codes in the split-state model
• Optimal computational split-state non-malleable codes
• Continuously non-malleable codes in the split-state model from minimal assumptions
• Practical non-malleable codes from symmetric-key primitives in 2-split-state model
• Non-malleable codes for space-bounded tampering
• Non-malleable codes

Cites work

• A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations
• Advances in Cryptology – CRYPTO 2004
• Bounded tamper resilience: how to go beyond the algebraic barrier
• 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
• Efficient non-malleable codes and key-derivation for poly-size tampering circuits
• Efficient noninteractive proof systems for bilinear groups
• Efficient public-key cryptography with bounded leakage and tamper resilience
• Fast Software Encryption
• Foundations of non-malleable hash and one-way functions
• scientific article; zbMATH DE number 2009976 (Why is no real title available?)
• Locally decodable and updatable non-malleable codes and their applications
• Malleable proof systems and applications
• Non-malleable codes for bounded depth, bounded fan-in circuits
• Non-malleable codes from additive combinatorics (extended abstract)
• Non-malleable codes from two-source extractors
• Non-malleable Codes with Split-State Refresh
• Non-malleable functions and their applications
• On related-secret pseudorandomness
• One-time computable self-erasing functions
• Private Circuits II: Keeping Secrets in Tamperable Circuits
• Public Key Encryption against Related Key Attacks
• Public-Key Cryptosystems Resilient to Key Leakage
• Related-key security for hybrid encryption
• RKA security beyond the linear barrier: IBE, encryption and signatures
• Securing circuits and protocols against \(1/\mathrm{poly}(k)\) tampering rate
• Storing Secrets on Continually Leaky Devices
• Tamper and Leakage Resilience in the Split-State Model
• Tamper detection and continuous non-malleable codes
• Tamper resilient circuits: the adversary at the gates
• Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience
• The Chaining Lemma and its application

Cited in

(6)

• Continuously non-malleable codes in the split-state model
• Leakage-resilient non-malleable codes
• Non-malleable Codes with Split-State Refresh
• Continuously non-malleable codes with split-state refresh
• Continuously non-malleable codes with split-state refresh
• (Continuous) Non-malleable Codes for Partial Functions with Manipulation Detection and Light Updates

This page was built for publication: Non-malleable Codes with Split-State Refresh

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