搜索结果: 1-15 共查到“军事学 round optimal”相关记录26条 . 查询时间(0.276 秒)
On Round Optimal Statistical Zero Knowledge Arguments
zero knowledge collision resistance statistically hiding commitments
2019/6/4
We construct the first three message statistical zero knowledge arguments for all of NP, matching the known lower bound. We do so based on keyless multi-collision resistant hash functions and other st...
On Round Optimal Secure Multiparty Computation from Minimal Assumptions
cryptographic protocols multiparty computation
2019/2/28
We study the problem of constructing secure multiparty computation (MPC) protocols in the standard broadcast communication model from {\em minimal} assumptions. We focus on security in the plain model...
Multikey fully homomorphic encryption (MFHE) allows homomorphic operations between ciphertexts encrypted under different keys. In applications for secure multiparty computation (MPC)protocols, MFHE ca...
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission
mobile tt-adversary PSMT
2018/12/3
In a network of nn nodes (modelled as a digraph), the goal of a perfectly secret message transmission (PSMT) protocol is to replicate sender's message mm at the receiver's end without revealing any in...
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
2018/11/8
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for an...
Motivatedbytheoreticalandpracticalconsiderations,anim- portant line of research is to design secure computation protocols that only make black-box use of cryptography. An important component in nearly...
Guaranteed output delivery: We also construct protocols that achieve security with guaranteed output delivery: (i) Against fail-stop adversaries, we construct two round MPC either in the (bare) public...
Efficient, Round-optimal, Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
Oblivious Transfer Commitment Schemes Universal Composability
2017/12/1
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it m...
Promise Zero Knowledge and its Applications to Round Optimal MPC
Zero knowledge MPC Coin Tossing
2017/11/13
We devise a new partitioned simulation technique for MPC where the simulator uses different strategies for simulating the view of aborting adversaries and non-aborting adversaries. The protagonist of ...
Round-Optimal Secure Multi-Party Computation
Secure Multi-Party Computation Garbled Circuits Round Complexity
2017/11/1
Secure multi-party computation (MPC) is a central cryptographic task that allows a set of mutually distrustful parties to jointly compute some function of their private inputs where security should ho...
Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
Two-Party Computation Oblivious Transfer Simultaneous Model Exchange Channel
2017/9/25
In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming...
Round Optimal Concurrent Non-Malleability from Polynomial Hardness
non-malleable commitments polynomial three round
2017/8/2
Non-malleable commitments are a central cryptographic primitive that guarantee security against man-in-the-middle adversaries, and their exact round complexity has been a subject of great interest. Pa...
Round Optimal Concurrent MPC via Strong Simulation
concurrent mpc superpolynomial simulation strong simulation
2017/6/22
In this paper, we study the round complexity of concurrently secure multi-party computation (MPC) with super-polynomial simulation (SPS) in the plain model. In the plain model, there are known explici...
We present a new approach towards constructing round-optimal secure multiparty computation (MPC) protocols against malicious adversaries without trusted setup assumptions. Our approach builds on ideas...
Efficient Round-Optimal Blind Signatures in the Standard Model
Blind Signatures Round-Optimal Partial Blindness
2017/2/20
Blind signatures are at the core of e-cash systems and has numerous other applications. In this work we construct efficient blind and partially blind signature schemes over bilinear groups in the stan...