搜索结果: 1-15 共查到“密码学 black-box”相关记录61条 . 查询时间(0.062 秒)
A Coin-Free Oracle-Based Augmented Black Box Framework
Black Box Construction Zero-Knowledge Proof NIZK
2019/7/25
After the work of Impagliazzo and Rudich (STOC, 1989), the black box framework has become one of the main research domain of cryptography. However black box techniques say nothing about non-black box ...
Black-Box Language Extension of Non-Interactive Zero-Knowledge Arguments
NIZK USS-NIZK black-box construction
2019/6/13
Highly efficient non-interactive zero-knowledge arguments (NIZK) are often constructed for limited languages and it is not known how to extend them to cover wider classes of languages in general. In t...
On the Complexity of Collision Resistant Hash Functions: New and Old Black-Box Separations
Collision Resistance Statistical Zero Knowledge Black box separations
2019/6/12
The complexity of collision-resistant hash functions has been long studied in the theory of cryptography. While we often think about them as a Minicrypt primitive, black-box separations demonstrate th...
Simple Yet Efficient Knowledge-Sound and Non-Black-Box Any-Simulation-Extractable ZK-SNARKs
NIZK QAP QSP
2019/6/4
Motivated by applications like verifiable computation and privacy-preserving cryptocurrencies, many efficient pairing-based SNARKs were recently proposed. However, the most efficient SNARKs like the o...
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
black-box barriers one-way functions derandomization
2018/11/19
The key observation underlying our approach is that Rudich's impossibility result applies not only to one-way functions as the underlying primitive, but in fact to a variety of "unstructured'' primiti...
Finding Collisions in a Quantum World: Quantum Black-Box Separation of Collision-Resistance and One-Wayness
post-quantum cryptography one-way permutation one-way trapdoor permutation
2018/11/12
Since the celebrated work of Impagliazzo and Rudich (STOC 1989), a number of black-box impossibility results have been established. However, these works only ruled out classical black-box reductions a...
Weak Zero-Knowledge Beyond the Black-Box Barrier
zero knowledge non-black-box techniques fully-homomorphic encryption
2018/11/9
The round complexity of zero-knowledge protocols is a long-standing open question, yet to be settled under standard assumptions. So far, the question has appeared equally challenging for relaxations s...
We continue the study of protocols for secure multiparty computation (MPC) that require only two rounds of interaction. The recent works of Garg and Srinivasan (Eurocrypt 2018) and Benhamouda and Lin ...
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
2018/11/8
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for an...
Motivatedbytheoreticalandpracticalconsiderations,anim- portant line of research is to design secure computation protocols that only make black-box use of cryptography. An important component in nearly...
A New Approach to Black-Box Concurrent Secure Computation
black-box construction concurrent security multi-party computation
2018/3/7
We consider the task of constructing concurrently composable protocols for general secure computation by making only black-box use of underlying cryptographic primitives. Existing approaches for this ...
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...
A Unified Approach to Constructing Black-box UC Protocols in Trusted Setup Models
secure computation black-box constructions
2017/9/28
We present a unified framework for obtaining black-box constructions of Universal Composable (UC) protocol in trusted setup models. Our result is analogous to the unified framework of Lin, Pass, and V...
It is tempting to think that if we encrypt a sequence of messages {xi} using a semantically secure encryption scheme, such that each xi is encrypted with its own independently generated public key pki...
Black-Box Constructions of Signature Schemes in the Bounded Leakage Setting
identity-based signature certificateless signature black-box construction
2017/6/28
To simplify the certificate management procedures, Shamir introduced the concept of identity-based cryptography (IBC). However, the key escrow problem is inherent in IBC. To get rid of it, Al-Riyami a...