搜索结果: 1-15 共查到“军事学 Constant-Round”相关记录35条 . 查询时间(0.236 秒)
Constant-Round Group Key Exchange from the Ring-LWE Assumption
Group key exchange Ring learning with errors Post-quantum cryptography
2019/4/22
Group key-exchange protocols allow a set of N parties to agree on a shared, secret key by communicating over a public network. A number of solutions to this problem have been proposed over the years, ...
Efficient Scalable Constant-Round MPC via Garbled Circuits
Garbled Circuits Constant Round MPC Key-Homomorphic PRFs
2017/9/13
In the setting of secure multiparty computation, a set of mutually distrustful parties carry out a joint computation of their inputs, without revealing anything but the output. Over recent years, ther...
Efficient, Constant-Round and Actively Secure MPC: Beyond the Three-Party Case
Actively Secure MPC Implementation
2017/6/6
These are exciting times for secure multi-party computation (MPC). While the feasibility of constant-round and actively secure MPC has been known for over two decades, the last few years have witnesse...
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
MPC cryptographic protocols
2017/3/6
In this work, we present a new universally composable, actively secure, constant round multi-party protocol for generating BMR garbled circuits with free-XOR and reduced costs. Specifically, the cost ...
Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model
Secure Computation Tamper-Proof Hardware Adaptive Security
2017/2/20
Achieving constant-round adaptively secure protocols (where all parties can be corrupted) in the plain model is a notoriously hard problem. Very recently, three works published in TCC 2015 (Dachman-So...
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
adaptive security Yao garbled circuits secure computation
2017/1/3
Yao's garbling scheme is one of the basic building blocks of cryptographic protocol design. Originally designed to enable two-message, two-party secure computation, the scheme has been extended in man...
Constant-Round Maliciously Secure Two-Party Computation in the RAM Model
RAM cryptographic protocols
2016/12/10
The random-access memory (RAM) model of computation allows program constant-time memory lookup and is more applicable in practice today, covering many important algorithms. This is in contrast to the ...
Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO
Secure Two-party Computation Implementation LEGO
2016/12/7
Secure two-party computation (S2PC) allows two parties to compute a function on their
joint inputs while leaking only the output of the function. At TCC 2009 Orlandi and Nielsen proposed
the LEGO pr...
Constant-Round Asynchronous Multi-Party Computation
Multi-Party Computation Constant-Round Protocols Asynchronous Model
2016/2/26
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely
compute a joint function of their inputs and exists in two main variants: In synchronous MPC
parties are ...
We present a multi-party computation protocol in the case
of dishonest majority which has very low round complexity. Our protocol
sits philosophically between Gentry’s Fully Homomorphic Encryption
...
Constant-round Leakage-resilient Zero-knowledge from Collision Resistance
zero-knowledge leakage-resistance
2016/1/26
We construct a constant-round leakage-resilient zero-knowledge argument system under the
existence of collision-resistant hash function family. That is, using collision-resistant hash functions,
we ...
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
constant-round cryptographic protocols multi-party computation pseudo-random generator
2016/1/26
We present a pseudo-random bit generator expanding a uniformly random bitstring
r of length k/2, where k is the security parameter, into a pseudo-random bit-string
of length 2k − log2
(k) usi...
Private Web Search with Constant Round Efficiency
Private web search (PWS) Secret sharing Public-key encryption
2016/1/8
Web search is increasingly becoming an essential activity as it is frequently
the most effective and convenient way of finding information. However, it can be a threat
for the privacy of users becau...
Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP
zero-knowledge proofs proofs of knowledge leakage-resilient
2016/1/7
Garg, Jain, and Sahai first consider zero knowledge proofs in the
presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge
proof system for HC (Hamiltonian...
Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation
Concurrent ZK Constant-Round Indistinguishability Obfuscation
2016/1/5
We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol
relies on the existence of families of collision-resistant hash functions, one-way permutations,
and indistinguish...