搜索结果: 1-11 共查到“军事学 non-black-box”相关记录11条 . 查询时间(0.109 秒)
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...
Towards Non-Black-Box Separations of Public Key Encryption and One Way Function
black-box separation public key encryption one-way function
2016/12/10
Separating public key encryption from one way functions is one of the fundamental goals of complexity-based cryptography. Beginning with the seminal work of Impagliazzo and Rudich (STOC, 1989), a sequ...
Black-Box Non-Black-Box Zero Knowledge
Black-box Constructions Non-black-box Simulation Input-size hiding
2016/1/9
Motivated by theoretical and practical interest, the challenging task of designing cryptographic
protocols having only black-box access to primitives has generated various breakthroughs
in the last ...
An Alternative Approach to Non-black-box Simulation in Fully Concurrent Setting
concurrent zero-knowledge non-black-box simulation
2016/1/4
We give a new proof of the existence of public-coin concurrent zero-knowledge arguments for
NP in the plain model under the existence of collision-resistant hash function families, which was
origina...
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
obfuscation zero-knowledge resettable-security
2015/12/31
The introduction of a non-black-box simulation technique by Barak (FOCS 2001) has been a major landmark in cryptography, breaking the previous barriers of black-box impossibility. Barak's technique ha...
Concurrent Secure Computation via Non-Black Box Simulation
Concurrent secure computation concurrent secure blind signatures
2015/12/21
We give first positive results for concurrent blind signatures and verifiable random functions
in the plain model as per the ideal/real world security definition. Our positive result is
somewhat sur...
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...
Non-Black-Box Simulation from One-Way Functions And Applications to Resettable Security
foundations / non-black-box simulations resettable security
2013/2/21
The simulation paradigm, introduced by Goldwasser, Micali and Rackoff, is of fundamental importance to modern cryptography. In a breakthrough work from 2001, Barak (FOCS'01) introduced a novel non-bla...
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Simultaneous Resettability Conjecture New Non-Black-Box Simulation Strategy resettable zero-knowledge proofs
2009/6/11
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of
resettable zero-knowledge proofs, where the protocol must be zero-knowledge even if
a cheating verifier can reset the ...
Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols
Non-black-box Techniques Constant Round Non-malleable Protocols generic adversaries
2009/6/3
Recently, non-black-box techniques have enjoyed great success in cryptography. In particular, they
have led to the construction of constant round protocols for two basic cryptographic tasks (in the p...
Lower Bounds for Non-Black-Box Zero Knowledge
Department of Computer Science, Bar-Ilan Universit Division of Engineering & Applied Science, Harvard University
2009/3/27
In contrast, we show that under reasonable assumptions, there does exist such a (compu-
tationally sound) argument system that is bounded-resettable zero knowledge.
The complexity assumptions we use...