搜索结果: 1-15 共查到“密码学 tampering”相关记录15条 . 查询时间(0.078 秒)
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...
In a poisoning attack against a learning algorithm, an adversary tampers with a fraction of the training data T with the goal of increasing the classification error of the constructed hypothesis/model...
Public Key Encryption Resilient to Post-Challenge Leakage and Tampering Attacks
After-the-Fact Post-challenge Entropic PKE
2018/11/13
In this paper, we introduce a new framework for constructing public-key encryption (PKE) schemes resilient to joint post-challenge/after-the-fact leakage and tampering attacks in the bounded leakage a...
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...
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...
Non-Malleable Codes from Average-Case Hardness: AC0, Decision Trees, and Streaming Space-Bounded Tampering
non-malleable codes streaming
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 ...
Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners
Tampering Extractors Adversarial Learning
2017/9/28
Austrin, Chung, Mahmoody, Pass and Seth (Crypto'14) studied the notion of bitwise pp-tampering attacks over randomized algorithms in which an efficient `virus' gets to control each bit of the randomne...
Non-Malleable Codes for Space-Bounded Tampering
Non-malleable Codes Proofs of Space Tamper-resilient Cryptography
2017/6/8
Non-malleable codes---introduced by Dziembowski, Pietrzak and Wichs at ICS 2010---are key-less coding schemes in which mauling attempts to an encoding of a given message, w.r.t.\ some class of tamperi...
Linear-Time Non-Malleable Codes in the Bit-Wise Independent Tampering Model
Non-malleable codes Bit-Wise Independent Tampering Model
2016/4/22
Non-malleable codes were introduced by Dziembowski et al. (ICS 2010) as coding schemes that protect a message against tampering attacks. Roughly speaking, a code is non-malleable if decoding an advers...
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-wise Tampering and Permutations
Non-malleable Codes Explicit Construction Information Theoretic
2016/1/6
A non-malleable code protects messages against a class of tampering functions. Informally,
a code is non-malleable if the effect of applying any tampering function on an encoded message
is to either...
Individualizing Electrical Circuits of Cryptographic Devices as a Means to Hinder Tampering Attacks
field multiplication individualizing electrical circuit of multiplier power traces
2015/12/30
Side channel and fault attacks take advantage from the fact that the
behavior of crypto implementations can be observed and provides hints that
simplify revealing keys. In a real word a lot of devic...
Tampering with the Delivery of Blocks and Transactions in Bitcoin
Bitcoin Scalability P2P networks
2015/12/29
Given the increasing adoption of Bitcoin, the number of transactions and the block sizes within the system are only expected to increase. To sustain its correct operation in spite of its ever-increasi...
Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits
information theory non-malleability codes
2014/3/6
Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS '10), provide roughly the following guarantee: if a codeword $c$ encoding some message $x$ is tampered to $c' = f(c)$ such that $c'...
Non-Malleable Coding Against Bit-wise and Split-State Tampering
Tamper-Resilient Cryptography Coding Theory
2014/3/10
Non-malleable coding, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), aims for protecting the integrity of information against tampering attacks in situations where error-detection is imposs...
Cryptography Secure Against Related-Key Attacks and Tampering
Related-key attack tamper-resistance pseudorandom functions signatures identity-based encryption
2012/3/28
We show how to leverage the RKA (Related-Key Attack) security of blockciphers to provide RKA security for a suite of high-level primitives. This motivates a more general theoretical question, namely, ...