搜索结果: 121-135 共查到“知识库 军事学”相关记录15045条 . 查询时间(8.11 秒)
Towards Instantiating the Algebraic Group Model
Public-key cryptography algebraic group model generic group model
font style='font-size:12px;'>
2019/9/16
The Generic Group Model (GGM) is one of the most important tools for analyzing the hardness of a cryptographic problem. Although a proof in the GGM provides a certain degree of confidence in the probl...
Revisiting the Hybrid attack on sparse and ternary secret LWE
Lattice-based Cryptography Learning with Errors Homomorphic Encryption
font style='font-size:12px;'>
2019/9/16
In the practical use of the Learning With Error (LWE) based cryptosystems, it is quite common to choose the secret to be extremely small: one popular choice is ternary (±1,0±1,0) coefficient vector, a...
Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity
polynomial commitments zero-knowledge proofs proximity testing
font style='font-size:12px;'>
2019/9/16
We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degre...
Halo: Recursive Proof Composition without a Trusted Setup
zero knowledge elliptic curve cryptosystem
font style='font-size:12px;'>
2019/9/16
Non-interactive proofs of knowledge allow us to publicly demonstrate the faithful execution of arbitrary computations. SNARKs have the additional property of succinctness, meaning that the proofs are ...
A Simple Key Reuse Attack on Ntru Cryptosystem
Lattice Encryption Ntru Cryptanalysis KEM
font style='font-size:12px;'>
2019/9/16
In 1998, Jerey Hostein, Jill Pipher, and Joseph H. Silverman introduced the famous Ntru cryptosystem, and called it "A ring-based public key cryptosystem". Actually it turns out to be a lattice based ...
Randomly Rotate Qubits Compute and Reverse --- IT-Secure Non-Interactive Fully-Compact Homomorphic Quantum Computations over Classical Data Using Random Bases
Homomorphic encryption Quantum cryptography Information-theoretic security
font style='font-size:12px;'>
2019/9/16
Homomorphic encryption (HE) schemes enable processing of encrypted data and may be used by a user to outsource storage and computations to an untrusted server. A plethora of HE schemes has been sugges...
Optimal-Round Preprocessing-MPC via Polynomial Representation and Distributed Random Matrix (extended abstract)
MPC with preprocessing correlated randomness optimal round complexity
font style='font-size:12px;'>
2019/9/16
We present preprocessing-MPC schemes of arithmetic functions with optimal round complexity, function-independent correlated randomness, and communication and space complexities that grow linearly with...
On Perfect Correctness without Derandomization
Indistinguishability Obfuscation Correctness Functional Encryption
font style='font-size:12px;'>
2019/9/16
We give a method to transform any indistinguishability obfuscator that suffers from correctness errors into an indistinguishability obfuscator that is perfectlyperfectly correct, assuming hardness of ...
Efficient Tightly-Secure Structure-Preserving Signatures and Unbounded Simulation-Sound QA-NIZK Proofs
Structure-preserving signatures QA-NIZK simulation-soundness
font style='font-size:12px;'>
2019/9/16
We show how to construct structure-preserving signatures (SPS) and unbounded quasi-adaptive non-interactive zero-knowledge (USS QA-NIZK) proofs with a tight security reduction to simple assumptions, b...
Quantum LLL with an Application to Mersenne Number Cryptosystems
quantum attack lattice reduction Grover's algorithm
font style='font-size:12px;'>
2019/9/16
In this work we analyze the impact of translating the well-known LLL algorithm for lattice reduction into the quantum setting. We present the first (to the best of our knowledge) quantum circuit repre...
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors
foundations lattice techniques
font style='font-size:12px;'>
2019/9/16
Abstract. There is a large gap between theory and practice in the complexities of sieving algorithms for solving the shortest vector problem in an arbitrary Euclidean lattice. In this paper, we work t...
Approximate Trapdoors for Lattices and Smaller Hash-and-Sign Signatures
Digital Signature Lattice
font style='font-size:12px;'>
2019/9/16
We study a relaxed notion of lattice trapdoor called approximate trapdoor, which is defined to be able to invert Ajtai's one-way function approximately instead of exactly. The primary motivation of ou...
How to leverage hardness of constant degree expanding polynomials over R to build iO
public-key cryptography Obfuscation
font style='font-size:12px;'>
2019/9/16
In this work, we introduce and construct DD-restricted Functional Encryption (FE) for any constant D≥3D≥3, based only on the SXDH assumption over bilinear groups. This generalizes the notion of 33-res...
An efficient and secure ID-based multi-proxy multi-signature scheme based on lattice
multi-proxy multi-signature scheme multi-signature scheme ID-based signature
font style='font-size:12px;'>
2019/9/16
Multi-proxy multi-signature schemes are useful in distributed networks, where a group of users cooperatively could delegate their administrative rights to the users of another group, who are authorize...