搜索结果: 1-15 共查到“军事学 Complete”相关记录25条 . 查询时间(0.123 秒)
A Complete and Efficient Key Mismatch Attack on NIST Candidate NewHope
key encapsulation mechanism NIST Candidate NewHope
2019/4/29
In CT-RSA 2019, Bauer et al. have analyzed the case when the public key is reused for the NewHope key encapsulation mechanism (KEM), a second-round candidate in the NIST Post-quantum Standard process....
Degree 2 is Complete for the Round-Complexity of Malicious MPC
foundations Multi-Party Computation
2019/3/1
We show, via a non-interactive reduction, that the existence of a secure multi-party computation (MPC) protocol for degree-22 functions implies the existence of a protocol with the same round complexi...
Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker
Provable security Computationally complete symbolic attacke Vote privacy
2018/6/25
We analyze the FOO electronic voting protocol in the provable secu- rity model using the technique of Computationally Complete Symbolic Attacker (CCSA). The protocol uses commitments, blind signatures...
Complete Attack on RLWE Key Exchange with reused keys, without Signal Leakage
RLWE key exchange post quantum
2017/12/13
Key Exchange (KE) from RLWE (Ring-Learning with Errors) is a potential alternative to Diffie-Hellman (DH) in a post quantum setting. Key leakage with RLWE key exchange protocols in the context of key ...
On the Security of Practical and Complete Homomorphic Encrypted Computation
foundations Encrypted Computation
2017/1/3
Security with respect to the operator as an adversary is considered for processors supporting unbounded general purpose homomorphic encrypted computation. An efficient machine code architecture is def...
Implementing Complete Formulas on Weierstrass Curves in Hardware
Elliptic curve cryptography FPGA Weierstrass curves
2016/12/12
This work revisits the recent complete addition formulas for prime order elliptic curves of Renes, Costello and Batina in light of parallelization. We introduce the first hardware implementation of th...
High Saturation Complete Graph Approach for EC Point Decomposition and ECDL Problem
ECDL problem Semaev polynomials block ciphers
2016/7/20
One of the key questions in contemporary applied cryptography is whether there exist an efficient algorithm for solving the discrete logarithm problem in elliptic curves. The primary approach for this...
Crepeau and Santha, in 1991, posed the question of reversibility of functionalities, that is, which functionalities when used in one direction, could securely implement the identical functionality in ...
Complete characterization of generalized bent and 2^k-bent Boolean functions
Boolean functions 2k-bent Boolean functions
2016/4/7
In this paper we investigate properties of generalized bent Boolean functions and 2k-bent (i.e., negabent, octabent, hex- adecabent, et al.) Boolean functions in a uniform framework. We generalize the...
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability
formal verification computational security guarantees
2016/1/27
In recent years, a new approach has been developed for verifying security protocols with the aim of combining the benefits of symbolic attackers and the benefits of unconditional soundness: the techni...
Towards Characterizing Complete Fairness in Secure Two-Party Computation
Complete fairness secure two-party computation foundations
2016/1/26
The well known impossibility result of Cleve (STOC 1986) implies that in general it is
impossible to securely compute a function with complete fairness without an honest majority.
Since then, the ac...
An Applicable Public-Key-Cryptosystem Based on NP-Complete Problems
Applicable Public-Key-Cryptosystem NP-Complete Problems
2016/1/25
A new Public-Key-Cryptosystem is presented from which we think that it will survive against possible attacks by Quantum-Computers in the future. We analyse its performance and its expected security.
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
Fairness secure two-party computation foundations
2016/1/5
Fairness is a desirable property in secure computation; informally it means that if one party gets the output of the function, then all parties get the output. Alas, an implication of Cleve's result (...
A Complete and Linear Physical Characterization Methodology for the Arbiter PUF Family
Physically Unclonable Function Arbiter PUF Photonic emission analysis
2015/12/23
As intended by its name, Physically Unclonable Functions
(PUFs) are considered as an ultimate solution to deal with insecure storage,
hardware counterfeiting, and many other security problems. Howev...
Complete addition formulas for prime order elliptic curves
public-key cryptography elliptic curves short Weierstrass form
2015/12/21
An elliptic curve addition law is said to be complete if it correctly computes the
sum of any two points in the elliptic curve group. One of the main reasons for the increased
popularity of Edwards ...