搜索结果: 1-15 共查到“密码学 non-malleable codes”相关记录41条 . 查询时间(0.125 秒)
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space
Non-Malleable Codes Proofs of Space Tamper-resilience
font style='font-size:12px;'>
2019/5/24
Non-malleable codes are encoding schemes that provide protections against various classes of tampering attacks. Recently Faust et al. (CRYPTO 2017) initiated the study of space- bounded non-malleable ...
Inception makes non-malleable codes shorter as well!
Non-malleable codes Randomness extraction
font style='font-size:12px;'>
2019/4/22
Non-malleable codes, introduced by Dziembowski, Pietrzak and Wichs in ICS 2010, have emerged in the last few years as a fundamental object at the intersection of cryptography and coding theory. Non-ma...
Non-Malleable Codes for Decision Trees
non-malleable codes decision trees small-depth circuits
font style='font-size:12px;'>
2019/4/16
We construct efficient, unconditional non-malleable codes that are secure against tampering functions computed by decision trees of depth d=n1/4−o(1)d=n1/4−o(1). In particular, each bit of...
Rate-Optimizing Compilers for Continuously Non-Malleable Codes
non-malleable codes tamper-proof security
font style='font-size:12px;'>
2019/1/26
For the case of split-state tampering, we establish the existence of rate-one continuously non-malleable codes with computational security, in the (non-programmable) random oracle model. We further ex...
Expander Graphs are Non-Malleable Codes
Non-malleable code Split-state Explicit Constructions
font style='font-size:12px;'>
2018/11/8
Any dd-regular graph on nn vertices with spectral expansion λλ satisfying n=Ω(d3log(d)/λ)n=Ω(d3log(d)/λ) yields a O(λ3/2d)O(λ3/2d)-non-malleable code in the split-state model.
Non-Malleable Codes Against Bounded Polynomial Time Tampering
non-malleable code non-malleable commitment derandomization
font style='font-size:12px;'>
2018/11/2
We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) mod...
Continuously Non-Malleable Codes with Split-State Refresh
non-malleable codes tamper-resilient cryptography split-state model
font style='font-size:12px;'>
2018/6/19
Non-malleable codes for the split-state model allow to encode a message into two parts, such that arbitrary independent tampering on each part, and subsequent decoding of the corresponding modified co...
Non-Malleable Codes for Partial Functions with Manipulation Detection
non-malleable codes manipulation-detection codes tamper-resilient cryptography
font style='font-size:12px;'>
2018/6/5
Non-malleable codes were introduced by Dziembowski, Pietrzak and Wichs (ICS '10) and its main application is the protection of cryptographic devices against tampering attacks on memory. In this work, ...
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions
continuously non-malleable codes split-state tampering plain model
font style='font-size:12px;'>
2018/6/5
At ICS 2010, Dziembowski, Pietrzak and Wichs introduced the notion of *non-malleable codes*, a weaker form of error-correcting codes guaranteeing that the decoding of a tampered codeword either corres...
Upper and Lower Bounds for Continuous Non-Malleable Codes
Continuous non-malleable codes black box impossibility split-state
font style='font-size:12px;'>
2018/5/30
Recently, Faust et al. (TCC'14) introduced the notion of continuous non-malleable codes (CNMC), which provides stronger security guarantees than standard non-malleable codes, by allowing an adversary ...
Non-Malleable Extractors and Non-Malleable Codes: Partially Optimal Constructions
non-malleable code privacy amplification non-malleable extractor
font style='font-size:12px;'>
2018/4/20
The recent line of study on randomness extractors has been a great success, resulting in exciting new techniques, new connections, and breakthroughs to long standing open problems in several seemingly...
Privacy Amplification from Non-malleable Codes
Non-malleability Privacy Amplification Information-theoretic Key Agreement
font style='font-size:12px;'>
2018/3/29
In this paper, we connect two interesting problems in the domain of Information-Theoretic Cryptography: "Non-malleable Codes" and "Privacy Amplification". Non-malleable codes allow for encoding a mess...
Short Non-Malleable Codes from Related-Key Secure Block Ciphers
Non-malleable code split-state tampering model related-key security
font style='font-size:12px;'>
2018/3/5
A non-malleable code is an unkeyed randomized encoding scheme that offers the strong guarantee that decoding a tampered codeword either results in the original message, or in an unrelated message.
Non-Malleable Codes for Small-Depth Circuits
non-malleable codes small-depth circuit switching lemma
font style='font-size:12px;'>
2018/3/5
We obtain our codes via a new efficient non-malleable reduction from small-depth tampering to split-state tampering. A novel aspect of our work is the incorporation of techniques from unconditional de...
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
font style='font-size:12px;'>
2017/11/3
We show a general framework for constructing non-malleable codes against tampering families with average-case hardness bounds. Our framework adapts ideas from the Naor-Yung double encryption paradigm ...