搜索结果: 1-15 共查到“军队指挥学 Amplification”相关记录23条 . 查询时间(0.078 秒)
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge
NIZK Security Amplification
2019/6/4
We develop novel techniques to leverage the use of leakage simulation lemma (Jetchev-Peitzrak TCC 2014) to argue amplification. A crucial component of our result is a new notion for secret sharing NPN...
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
PFG iO
2019/6/4
The existence of secure indistinguishability obfuscators (iO) has far-reaching implications, significantly expanding the scope of problems amenable to cryptographic study. All known approaches to cons...
Theoretical and Practical Approaches for Hardness Amplification of PUFs
Hardness Amplification Complexity Theory FPGA Security
2019/5/23
The era of PUFs has been characterized by the efforts put into research and the development of PUFs that are robust against attacks, in particular, machine learning (ML) attacks. In the lack of system...
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...
Error Amplification in Code-based Cryptography
post-quantum cryptography MDPC timing attack
2019/1/2
Code-based cryptography is one of the main techniques enabling cryptographic primitives in a post-quantum scenario. In particular, the MDPC scheme is a basic scheme from which many other schemes have ...
Privacy Amplification from Non-malleable Codes
Non-malleability Privacy Amplification Information-theoretic Key Agreement
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...
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
Communication Complexity Conditional Disclosure of Secrets Amplification
2017/2/24
In the \emph{conditional disclosure of secrets} problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold inputs xx and yy respectively, wish to release a common secret ss to Carol...
Simultaneous Secrecy and Reliability Amplification for a General Channel Model
channel secrecy reliability
2016/12/10
We present a general notion of channel for cryptographic purposes, which can model either a (classical) physical channel or the consequences of a cryptographic protocol, or any hybrid. We consider {\e...
Private Circuits III: Hardware Trojan-Resilience via Testing Amplification
hardware trojan horses secure multiparty computations
2016/12/8
Security against hardware trojans is currently becoming an essential ingredient to ensure trust in information systems. A variety of solutions have been introduced to reach this goal, ranging from rea...
Erasable memory is an important resource for designing practical cryptographic protocols that are secure against adaptive attacks. Many practical memory devices such as solid state drives, hard disks,...
Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification
Low Noise LPN Key Dependent Message Security LPN Hardness Reduction
2016/1/5
Cryptographic schemes based on the Learning Parity with Noise (LPN) problem have several
very desirable aspects: Low computational overhead, simple implementation and conjectured
post-quantum hardne...
Non-Malleable Condensers for Arbitrary Min-Entropy, and Almost Optimal Protocols for Privacy Amplification
privacy amplification non-malleable extractor
2016/1/5
Recently, the problem of privacy amplification with an active adversary has received a lot of attention. Given a shared n-bit weak random source X with min-entropy k and a security parameter s, the ma...
Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification
Affine-malleable Extractors Spectrum Doubling
2015/12/21
The study of seeded randomness extractors is a major line of research in theoretical computer
science. The goal is to construct deterministic algorithms which can take a “weak” random
source X with ...
We study the classical problem of privacy amplification, where two parties Alice and Bob share a weak secret $X$ of min-entropy $k$, and wish to agree on secret key $R$ of length $m$ over a public com...
A $d$-broadcast primitive is a communication primitive that allows a sender to send a value from a domain of size $d$ to a set of parties. A broadcast protocol emulates the $d$-broadcast primitive usi...