搜索结果: 1-15 共查到“军事学 Communication”相关记录113条 . 查询时间(0.246 秒)
Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity
polynomial commitments zero-knowledge proofs proximity testing
2019/9/16
We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degre...
Quantum Alice and Silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication
quantum cryptography quantum key recycling
2019/8/2
We introduce a Quantum Key Recycling (QKR) protocol that needs no classical communication from Alice to Bob. Alice sends only a cipherstate, which consists of qubits that are individually measured by ...
HoneyBadgerMPC and AsynchroMix: Practical AsynchronousMPC and its Application to Anonymous Communication
multiparty computation robustness
2019/8/2
Multiparty computation as a service (MPSaaS) is a promising approach for building privacy-preserving communication systems.However, in this paper, we argue that existing MPC implementations are inadeq...
Simple and Efficient Approach for Achieving End-to-End Anonymous Communication
cryptographic protocols Anonymous communication
2019/7/15
Anonymous communication, that is secure end-to-end and unlinkable, plays a critical role in protecting user privacy by preventing service providers from using message metadata to discover communicatio...
Communication-Efficient Unconditional MPC with Guaranteed Output Delivery
Multiparty Computation Information-theoretic Cryptography Communication Complexity
2019/6/5
We study the communication complexity of unconditionally secure MPC with guaranteed output delivery over point-to-point channels for corruption threshold ttion: “is it possib...
When Encryption is Not Enough -- Effective Concealment of Communication Pattern, even Existence (BitGrey, BitLoop)
Zero-Leakage Information Hiding Winnowing
2019/5/27
How much we say, to whom, and when, is inherently telling, even if the contents of our communication is unclear. In other words: encryption is not enough; neither to secure privacy, nor to maintain co...
Enigma 2000: An Authenticated Encryption Algorithm For Human-to-Human Communication
Enigma Machine authenticated encryption polyalphabetic cipher
2019/5/21
Enigma 2000 (E2K) is a cipher that updates the World War II-era Enigma Machine for the twenty-first century. Like the original Enigma, E2K is intended to be computed by an offline device; this prevent...
Secure Communication Channel Establishment: TLS 1.3 (over TCP Fast Open) vs. QUIC
applied cryptography provable security TLS
2019/4/29
Secure channel establishment protocols such as TLS are some of the most important cryptographic protocols, enabling the encryption of Internet traffic. Reducing the latency (the number of interactions...
Efficient Circuit-based PSI with Linear Communication
Private Set Intersection Secure Computation
2019/3/4
We present a new protocol for computing a circuit which implements the private set intersection functionality (PSI). Using circuits for this task is advantageous over the usage of specific protocols f...
The Communication Complexity of Threshold Private Set Intersection
Communication Complexity Private Set Intersection
2019/3/1
Threshold private set intersection enables Alice and Bob who hold sets AA and BB of size nn to compute the intersection A∩BA∩B if the sets do not differ by more than some threshold parameter tt. In th...
Adaptively Secure MPC with Sublinear Communication Complexity
secure multiparty computation adaptive security sublinear communication
2018/12/3
A central challenge in the study of MPC is to balance between security guarantees, hardness assumptions, and resources required for the protocol. In this work, we study the cost of tolerating adaptive...
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe
information theoretic cryptography communication complexity
2018/12/3
In the Conditional Disclosure of Secrets (CDS) problem (Gertner et al., J. Comput. Syst. Sci., 2000) Alice and Bob, who hold nn-bit inputs xx and yy respectively, wish to release a common secret zz to...
Two Party Distribution Testing: Communication and Security
foundations secure computation distribution testing
2018/11/12
We study the problem of discrete distribution testing in the two-party setting. For example, in the standard closeness testing problem, Alice and Bob each have tt samples from, respectively, distribut...
Synchronous Byzantine Agreement with Expected $O(1)$ Rounds, Expected $O(n^2)$ Communication, and Optimal Resilience
Optimal Resilience authenticated setting
2018/11/2
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of ff faults among n=2f+1n=2f+1 parties. Our protocols achieve an expected ...
Must the Communication Graph of MPC Protocols be an Expander?
secure multiparty computation expander graph communication locality
2018/6/5
Secure multiparty computation (MPC) on incomplete communication networks has been studied within two primary models: (1) Where a partial network is fixed a priori, and thus corruptions can occur depen...