搜索结果: 1-15 共查到“军事学 information-theoretic”相关记录28条 . 查询时间(0.093 秒)
Efficient Information-Theoretic Secure Multiparty Computation over Z/pkZ via Galois Rings
MPC Galois Rings
2019/7/30
At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2kZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integer...
On Quantum Advantage in Information Theoretic Single-Server PIR
quantum complexity private information retrieval specious security
2019/3/4
In (single-server) Private Information Retrieval (PIR), a server holds a large database DBDB of size nn, and a client holds an index i∈[n]i∈[n] and wishes to retrieve DB[i]DB[i] without revealing ii t...
Efficient Information Theoretic Multi-Party Computation from Oblivious Linear Evaluation
information theoretic multi-party computation oblivious linear evaluation
2019/1/2
Oblivious linear evaluation (OLE) is a two party protocol that allows a receiver to compute an evaluation of a sender's private, degree 11 polynomial, without letting the sender learn the evaluation p...
Information-Theoretic Broadcast with Dishonest Majority for Long Messages
Byzantine broadcast information-theoretic security dishonest majority
2018/11/16
Byzantine broadcast is a fundamental primitive for secure computation. In a setting with nn parties in the presence of an adversary controlling at most tt parties, while a lot of progress in optimizin...
Scalable One-Time Pad --- From Information Theoretic Security to Information Conservational Security
Information Conservational Security Data Compression Quantum-Fuzzy Collective Precision
2018/11/16
Whereas it is widely deemed an impossible task to scale One-Time Pad (OTP) without sacrificing information theoretic security or network traffic, this paper presents a paradigm of Scalable OneTime Pad...
Two Round Information-Theoretic MPC with Malicious Security
MPC Round-optimal Information-theoretic
2018/11/12
We provide the first constructions of two round information-theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any tmalicious corruptions. Our prot...
We continue the study of protocols for secure multiparty computation (MPC) that require only two rounds of interaction. The recent works of Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin ...
We reconsider the security guarantee that can be achieved by general protocols for secure multiparty computation in the most basic of settings: information-theoretic security against a semi-honest adv...
Information-Theoretic Secret-Key Agreement: The Secret-Key Rate as a Function of the Channel Quality Ratio
Secret-Key Agreement Information-theoretic security Satellite model
2017/11/28
Information theoretically secure secret-key exchange between two parties, Alice and Bob, is a well-studied problem that is provably impossible without additional assumptions. However, it has shown to ...
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic
Garbled Circuits Privacy-free Formula
2017/6/15
Garbled circuits are of central importance in cryptography, finding widespread application in secure computation, zero-knowledge (ZK) protocols, and verifiable outsourcing of computation to name a few...
Information-theoretic Indistinguishability via the Chi-squared Method
Symmetric cryptography information-theoretic indistinguishability provable security
2017/6/9
Proving tight bounds on information-theoretic indistinguishability is a central problem in symmetric cryptography. This paper introduces a new method for information-theoretic indistinguishability pro...
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model
non-malleable codes information theoretic security
2017/4/27
We present an information-theoretically secure continuously non-malleable code in the constant split-state model, where there is a self-destruct mechanism which ensures that the adversary loses access...
Information-theoretic Local Non-malleable Codes and their Applications
non-malleable codes locally decodable/updatable codes information-theoretic security
2015/12/21
Error correcting codes, though powerful, are only applicable
in scenarios where the adversarial channel does not introduce “too
many” errors into the codewords. Yet, the question of having guarantee...
Information Theoretic Security for Encryption Based on Conditional Renyi Entropies
Impossibility Symmetric-key Encryption
2014/3/11
In this paper, information theoretic cryptography is discussed based on conditional Renyi entropies. Our discussion focuses not only on cryptography but also on the de nitions of conditional Renyi e...
Information-theoretic Bounds for Differentially Private Mechanisms
Differential Privacy Information theory
2012/3/29
There are two active and independent lines of research that aim at quantifying the amount of information that is disclosed by computing on confidential data. Each line of research has developed its ow...