搜索结果: 1-15 共查到“军队指挥学 non-malleable”相关记录100条 . 查询时间(0.089 秒)
Non-malleable Zero-Knowledge Arguments with Lower Round Complexity
Zero-Knowledge Non-Malleable Multi-Collision Resistance
2019/8/30
Round complexity is one of the fundamental problems in zero-knowledge proof systems. Non-malleable zero-knowledge (NMZK) protocols are zero-knowledge protocols that provide security even when man-in-t...
Continuously Non-Malleable Secret Sharing for General Access Structures
Secret sharing Non-malleability Leakage resilience
2019/6/3
We study leakage-resilient continuously non-malleable secret sharing, as recently intro- duced by Faonio and Venturi (CRYPTO 2019). In this setting, an attacker can continuously tamper and leak from a...
Continuous Space-Bounded Non-Malleable Codes from Stronger Proofs-of-Space
Non-Malleable Codes Proofs of Space Tamper-resilience
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
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
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...
A Quantum-Proof Non-Malleable Extractor With Application to Privacy Amplification against Active Quantum Adversaries
Privacy Amplification Non-malleable extractors Quantum Cryptography
2019/3/1
privacy amplification, two mutually trusted parties aim to amplify the secrecy of an initial shared secret X in order to establish a shared private key K by exchanging messages over an insecure commun...
Non-Malleable Secret Sharing in the Computational Setting: Adaptive Tampering, Noisy-Leakage Resilience, and Improved Rate
secret sharing non-malleability leakage resilience computational security
2019/2/27
We revisit the concept of *non-malleable* secret sharing (Goyal and Kumar, STOC 2018) in the computational setting. In particular, under the assumption of one-to-one one-way functions, we exhibit a *c...
Rate-Optimizing Compilers for Continuously Non-Malleable Codes
non-malleable codes tamper-proof security
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...
Non-malleable encryption with proofs of plaintext knowledge and applications to voting
anonymity applications election schemes
2019/1/16
Non-malleable asymmetric encryption schemes which prove plaintext knowledge are sufficient for secrecy in some domains. For example, ballot secrecy in voting. In these domains, some applications deriv...
A threshold secret sharing scheme (with threshold tt) allows a dealer to share a secret among a set of parties such that any group of tt or more parties can recover the secret and no group of at most ...
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures
Non-malleable secret sharing Leakage-resilient secret sharing Non-malleable extractors
2018/12/3
In this work we present a collection of compilers that take secret sharing schemes for an arbitrary access structures as input and produce either leakage-resilient or non-malleable secret sharing sche...
Non-Malleable Extractors and Codes for Composition of Tampering, Interleaved Tampering and More
non-malleable codes non-malleable extractors explicit constructions
2018/11/12
Non-malleable codes were introduced by Dziembowski, Pietrzak, and Wichs (JACM 2018) as a generalization of standard error correcting codes to handle severe forms of tampering on codewords. This notion...
Expander Graphs are Non-Malleable Codes
Non-malleable code Split-state Explicit Constructions
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 Digital Lockers
Digital Lockers Point obfuscation Virtual black-box obfuscation
2018/11/6
An obfuscated program reveals nothing about its design other than its input/output behavior. A digital locker is an obfuscated program that outputs a stored cryptographic key if and only if a user ent...
Non-Malleable Codes Against Bounded Polynomial Time Tampering
non-malleable code non-malleable commitment derandomization
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...