搜索结果: 1-15 共查到“军队指挥学 Two-round”相关记录22条 . 查询时间(0.078 秒)
Low-Memory Attacks against Two-Round Even-Mansour using the 3-XOR Problem
Even-Mansour Cryptanalysis 3-XOR
2019/8/19
The iterated Even-Mansour construction is an elegant construction that idealizes block cipher designs such as the AES. In this work we focus on the simplest variant, the 2-round Even-Mansour construct...
We show a new general approach for constructing maliciously secure two-round oblivious transfer (OT). Specifically, we provide a generic sequence of transformations to upgrade a very basic notion of t...
Two round multiparty computation via Multi-key fully homomorphic encryption with faster homomorphic evaluations
Multi-key fully homomorphic encryption (MKFHE) NTRU two-round MPC
2019/1/4
Multi-key fully homomorphic encryption (MKFHE) allows computations on ciphertexts encrypted by different users (public keys), and the results can be jointly decrypted using the secret keys of all the ...
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 tous 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 ...
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
cryptographic protocols public-key operations
2018/3/6
We show new constructions of semi-honest and malicious two-round multiparty secure computation protocols using only (a fixed) poly(n,λ)poly(n,λ) invocations of a two-round oblivious transfer protocol ...
We provide new two-round multiparty secure computation (MPC) protocols assuming the minimal assumption that two-round oblivious transfer (OT) exists. If the assumed two-round OT protocol is secure aga...
In this paper, we initiate the study of \emph{garbled protocols} --- a generalization of Yao's garbled circuits construction to distributed protocols. More specifically, in a garbled protocol construc...
On Two Round Rerunnable MPC Protocols
cryptographic protocols Rerunnable Multiparty Protocols
2017/9/25
Two-rounds are minimal for all MPC protocols in the absence of a trusted PKI, however certain protocols allow the reuse of inputs for different functions, or the re-evaluation of the same function on ...
New Key Recovery Attacks on Minimal Two-Round Even-Mansour Ciphers
block cipher Even-Mansour ciphers meet-in-the-middle attack
2017/9/14
Chen et al. proved that two variants of the two-round n-bit Even-Mansour ciphers are secure up to 22n/3 queries against distinguish- ing attacks. These constructions can be regarded as minimal two-rou...
Password-based authenticated key exchange (PAKE) enables two users with shared low-entropy passwords to establish cryptographically strong session keys over insecure networks. At Asiacrypt 2009, Katz ...
Two-Round Concurrent Non-Malleable Commitment from Time-Lock Puzzles
Non-malleable Commitments Time-lock Puzzles Two-round
2017/3/27
Non-malleable commitment is a fundamental cryptographic tool for preventing man-in-the-middle attacks. Since its proposal by Dolev, Dwork, and Noar in 1991, a rich line of research has steadily reduce...
The only known two-round multi-party computation protocol that withstands adaptive corruption of
all parties is the ingenious protocol of Garg and Polychroniadou [TCC 15]. We present protocols that
...
Two-Round Man-in-the-Middle Security from LPN
Secret-key authentication Man-in-the-Middle security LPN
2016/1/27
Secret-key authentication protocols have recently received a
considerable amount of attention, and a long line of research has been
devoted to devising efficient protocols with security based on the...
Minimizing the Two-Round Even-Mansour Cipher
generalized Even-Mansour cipher key-alternating cipher indistinguishability
2016/1/9
The r-round (iterated) Even-Mansour cipher (also known as key-alternating cipher)
defines a block cipher from r fixed public n-bit permutations P1, . . . , Pr as follows: given a sequence
of n-bit r...