搜索结果: 1-15 共查到“密码学 NP”相关记录21条 . 查询时间(0.078 秒)
A hash function family is called correlation intractable if for all sparse relations, it hard to find, given a random function from the family, an input output pair that satisfies the relation. Correl...
Reusable Designated-Verifier NIZKs for all NP from CDH
cryptographic protocols Zero-knowledge
2019/3/4
Non-interactive zero-knowledge proofs (NIZKs) are a fundamental cryptographic primitive. Despite a long history of research, we only know how to construct NIZKs under a few select assumptions, such as...
Noninteractive Zero Knowledge for NP from (Plain) Learning With Errors
noninteractive zero knowledge correlation intractability learning with errors
2019/2/25
We finally close the long-standing problem of constructing a noninteractive zero-knowledge (NIZK) proof system for any NP language with security based on the plain Learning With Errors (LWE) problem, ...
Efficient Zero-Knowledge for NP from Secure Two-Party Computation
Zero-knowledge claw-free permutation two-party computation
2019/1/30
Ishai et al. [28, 29] introduced a powerful technique that provided a general transformation from secure multiparty computation (MPC) protocols to zero-knowledge (ZK) proofs in a black-box way, called...
Monotone Batch NP-Delegation with Applications to Access Control
delegation witness indistinguishability access control
2018/5/2
Consider an access policy for some resource which only allows access to users of the system who own a certain set of attributes. Specifically, we consider the case where such an access structure is de...
Non-interactive zero-knowledge (NIZK) is a fundamental primitive that is widely used in the construction of cryptographic schemes and protocols. Despite this, general purpose constructions of NIZK pro...
Augmented Black-Box Zero-Knowledge Simulation And Zero Knowledge Argument for NP
zero-knowledge proofs (arguments) black-box simulation constant- round
2017/12/25
Zero knowledge property, proved by means of augmented black-box simulation, is called augmented black-box zero-knowledge. We present a 5-round statistical augmented black-box zero-knowledge argument f...
The possibility of basing cryptography on the minimal assumption NP⊈BPPNP⊈BPP is at the very heart of textbflexity-theoretic cryptography. The closest we have gotten so far is lattice-base...
Non-Interactive RAM and Batch NP Delegation from any PIR
Delegation No-Signaling Adaptive Soundness
2016/5/17
We present an adaptive and non-interactive protocol for verifying arbitrary efficient computations in fixed polynomial time. Our protocol is computationally sound and can be based on any computational...
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.
Secret-Sharing for NP
secret sharing obfuscation
2016/1/25
A computational secret-sharing scheme is a method that enables a dealer, that has a secret,
to distribute this secret among a set of parties such that a “qualified” subset of parties can
efficiently...
Constant-Round Leakage-Resilient Zero-Knowledge Arguments of Knowledge for NP
zero-knowledge proofs proofs of knowledge leakage-resilient
2016/1/7
Garg, Jain, and Sahai first consider zero knowledge proofs in the
presence of leakage on the local state of the prover, and present a leakageresilient-zero-knowledge
proof system for HC (Hamiltonian...
On Basing Private Information Retrieval on NP-Hardness
Private Information Retrieval NP-hardness Reductions
2015/12/21
The possibility of basing the security of cryptographic objects on the (minimal) assumption
that NP ⊈ BPP is at the very heart of complexity-theoretic cryptography. Most known results
along th...
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...
Resettably-Sound Resettable Zero Knowledge Arguments for NP
Resettably-Sound Resettable Zero Knowledge Arguments NP non-black-box
2009/6/11
We construct resettably-sound resettable zero knowledge arguments for NP based
on standard hardness assumption (the existence of claw-free permutations) in the plain model.
This proves the simultane...
