搜索结果: 1-15 共查到“军事学 Four”相关记录21条 . 查询时间(0.267 秒)
Four-Round Secure Multiparty Computation from General Assumptions
multi-party computation oblivious transfer round optimal
2019/2/28
In this work we continue the study on the round complexity of secure multi-party computation with black-box simulation in the simultaneous broadcast model where all the parties get the output.
We apply Smith's construction to generate four-dimensional GLV curves with fast arithmetic in the group law as well as in the base field. As Costello and Longa did in [5] for a 128-bit security level,...
Four-state Non-malleable Codes with Explicit Constant Rate
information theoretic cryptography non-malleability
2017/9/26
Non-malleable codes (NMCs), introduced by Dziembowski, Pietrzak and Wichs (ITCS 2010), generalize the classical notion of error correcting codes by providing a powerful guarantee even in scenarios whe...
Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
delayed-input protocols non-malleable zero knowledge multi-party coin tossing
2017/9/26
4-round non-malleable zero knowledge (NMZK): Goyal et al. in FOCS 2014 showed the first 4-round one-one NMZK argument from one-way functions (OWFs). Their construction requires the prover to know the ...
We construct a 4-round multi-party computation protocol for any functionality, which is secure against a malicious adversary. Our protocol relies on the sub-exponential hardness of the Learning with E...
FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime
four-dimensional decompositions Mersenne prime
2015/12/29
We introduce FourQ, a high-security, high-performance elliptic curve that targets the 128-
bit security level. At the highest arithmetic level, cryptographic scalar multiplications on FourQ can use
...
Four Neighbourhood Cellular Automata as Better Cryptographic Primitives
Cellular Automata nonlinearity CA rule 30
2015/12/25
Three-neighbourhood Cellular Automata (CA) are widely
studied and accepted as suitable cryptographic primitive. Rule 30, a
3-neighbourhood CA rule, was proposed as an ideal candidate for cryptograph...
The Multiplicative Complexity of Boolean Functions on Four and Five Variables
Affine transformation Boolean functions Circuit complexity
2015/12/23
A generic way to design lightweight cryptographic primitives is to construct simple rounds
using small nonlinear components such as 4x4 S-boxes and use these iteratively (e.g., PRESENT [1]
and SPONG...
In Cornell’s “CS4830: Introduction to Cryptography” offered Fall 2015, students are asked to devise
a physical secure two-party protocol for computing AND, using 4 cards or fewer. An elegant 5-card
...
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
Concurrent Zero Knowledge Non-black-box Simulation
2014/3/6
As recent studies show, the notions of *program obfuscation* and *zero knowledge* are intimately connected. In this work, we explore this connection further, and prove the following general result. If...
The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable endomorphisms to accelerate the computation of scalar multiplication of points on an abelian variety. Freeman and Satoh propose...
Cryptographic applications, such as hashing, block ciphers and stream ciphers, make use of functions which are simple by some criteria (such as circuit implementations), yet hard to invert almost ever...
RC4 has remained the most popular software stream cipher since the last two decades. In parallel to cryptanalytic attempts, researchers have come up with many variants of RC4, some targeted to more se...
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
implementation / Elliptic curves GLV scalar multiplication GLV curves
2012/3/22
The GLV method of Gallant, Lambert and Vanstone~(CRYPTO 2001) computes any multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with a low-degree endomorphism $\Phi$ (called GLV ...
Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
implementation / Elliptic curves GLV scalar multiplication GLV curves
2012/3/21
The GLV method of Gallant, Lambert and Vanstone~(CRYPTO 2001) computes any multiple $kP$ of a point $P$ of prime order $n$ lying on an elliptic curve with a low-degree endomorphism $\Phi$ (called GLV ...