搜索结果: 151-165 共查到“军队指挥学”相关记录14803条 . 查询时间(0.408 秒)
Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS
succinct arguments universal SRS algebraic holographic proofs
2019/9/19
We present a methodology to construct preprocessing zkSNARKs where the structured reference string (SRS) is universal and updatable. This exploits a novel use of *holography* [Babai et al., STOC 1991]...
A new elliptic curve point compression method based on Fp-rationality of some generalized Kummer surfaces
elliptic cryptography point compression Barreto-Naehrig curves
2019/9/19
In the article we propose a new compression method (to 2log2(p)+32log2(p)+3 bits) for the Fp2Fp2-points of an elliptic curve Eb:y2=x3+bEb:y2=x3+b (for b∈F∗p2b∈Fp2∗) of jj-invariant ...
CrypTFlow: Secure TensorFlow Inference
secure multi-party computation implementation TensorFlow
2019/9/19
We present CrypTFlow, a first of its kind system that converts TensorFlow inference code into Secure Multi-party Computation (MPC) protocols at the push of a button. To do this, we build three compone...
A New Attack on RSA and Demytko's Elliptic Curve Cryptosystem
RSA Cryptanalysis Coppersmith's method
2019/9/19
Let N=pqN=pq be an RSA modulus and ee be a public exponent. Numerous attacks on RSA exploit the arithmetical properties of the key equation ed−k(p−1)(q−1)=1ed−k(p−1)(q...
A New Public Key Cryptosystem Based on Edwards Curves
Elliptic curves Twisted Edwards curves RSA cryptosystem
2019/9/19
The elliptic curve cryptography plays a central role in various cryptographic schemes and protocols. For efficiency reasons, Edwards curves and twisted Edwards curves have been introduced. In this pap...
Improved Cryptanalysis of the KMOV Elliptic Curve Cryptosystem
public-key cryptography KMOV
2019/9/19
This paper presents two new improved attacks on the KMOV cryptosystem. KMOV is an encryption algorithm based on elliptic curves over the ring ZNZN where N=pqN=pq is a product of two large primes of eq...
Modeling Memory Faults in Signature and Encryption Schemes
fault attacks security model fault resilience deterministic signatures
2019/9/19
Memory fault attacks, inducing errors in computations, have been an ever-evolving threat to cryptographic schemes since their discovery for cryptography by Boneh et al. (Eurocrypt 1997). Initially req...
Dynamic Searchable Symmetric Encryption with Forward and Stronger Backward Privacy
Dynamic Searchable Symmetric Encryption Forward Privacy Backward Privacy
2019/9/19
Dynamic Searchable Symmetric Encryption (DSSE) enables a client to perform updates and searches on encrypted data which makes it very useful in practice. To protect DSSE from the leakage of updates (l...
In this paper, we study isogeny graphs of supersingular elliptic curves. Supersingular isogeny graphs were introduced as a hard problem into cryptography by Charles, Goren, and Lauter for the construc...
A Study of Persistent Fault Analysis
Fault Analysis PFA Feistel Networks Reverse Engineering
2019/9/19
Persistent faults mark a new class of injections that perturb lookup tables within block ciphers with the overall goal of recovering the encryption key. Unlike earlier fault types persistent faults re...
Privacy-preserving auditable token payments in a permissioned blockchain system
cryptographic protocols AML
2019/9/19
Token management systems were the first application of blockchain technology and are still the most widely used one. Early implementations such as Bitcoin or Ethereum provide virtually no privacy beyo...
A New Method for Geometric Interpretation of Elliptic Curve Discrete Logarithm Problem
Intersection of Curves Grobner Basis Vanishing Ideals
2019/9/19
In this paper, we intend to study the geometric meaning of the discrete logarithm problem defined over an Elliptic Curve. The key idea is to reduce the Elliptic Curve Discrete Logarithm Problem (EC-DL...
Sharing the LUOV: Threshold Post-Quantum Signatures
cryptographic protocols linear secret shared schemes
2019/9/19
We examine all of the signature submissions to Round-2 of the NIST PQC ``competition'' in the context of whether one can transform them into threshold signature schemes in a relatively straight forwar...
On Fully Secure MPC with Solitary Output
Multi-Party Computation Full Security Dishonest Majority Malicious Adversaries
2019/9/17
We study the possibility of achieving full security, with guaranteed output delivery, for secure multiparty computation of functionalities where only one party receives output, to which we refer as so...
The customary formulation of authenticated encryption (AE) requires the decrypting party to supply the correct nonce with each ciphertext it decrypts. To enable this, the nonce is often sent in the cl...