Filters








119,563 Hits in 4.4 sec

Isolated Proofs of Knowledge and Isolated Zero Knowledge [chapter]

Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs
Advances in Cryptology – EUROCRYPT 2008  
We introduce a new notion called -isolated proofs of knowledge ( -IPoK). These protocols securely ensure that an -isolated prover knows the witness.  ...  We consider proof of knowledge protocols where the cheating prover may communicate with some external adversarial environment during the run of the proof.  ...  Isolated Proof of Knowledge and Isolated Zero-Knowledge We start by introducing the notions of ∞-IPoK and ∞-IZK, and then discuss how to restrict the communication.  ... 
doi:10.1007/978-3-540-78967-3_29 dblp:conf/eurocrypt/DamgardNW08 fatcat:tl24qfi4onczfllf732gwvvuri

Statistical Concurrent Non-malleable Zero Knowledge [chapter]

Claudio Orlandi, Rafail Ostrovsky, Vanishree Rao, Amit Sahai, Ivan Visconti
2014 Lecture Notes in Computer Science  
The notion of Zero Knowledge introduced by Goldwasser, Micali and Rackoff in STOC 1985 is fundamental in Cryptography.  ...  zero-knowledge proofs/arguments.  ...  zero-knowledge proof system).  ... 
doi:10.1007/978-3-642-54242-8_8 fatcat:rekqz7kravevzhbuw3zwzxrspm

Universally Composable Multiparty Computation with Partially Isolated Parties [chapter]

Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs
2009 Lecture Notes in Computer Science  
The recent work of Katz shows that we may instead rely on physical assumptions, and in particular tamper-proof hardware tokens.  ...  For example, isolation might be achieved by asking Bob to put his functionality on a tamper-proof hardware token and assuming that Alice can prevent this token from communicating to the outside world.  ...  The work of [DNW08] defines partial isolation for the case of zero knowledge proofs of knowledge directly.  ... 
doi:10.1007/978-3-642-00457-5_19 fatcat:swtyisbl2rgwbjfqxx5lnj66uy

Page 6942 of Mathematical Reviews Vol. , Issue 95k [page]

1995 Mathematical Reviews  
This article contains some new noninteractive perfect zero-knowledge proofs and a technique for transforming cer- tain noninteractive zero-knowledge proofs into four-round zero-knowledge proofs.  ...  larger class of noninteractive zero-knowledge proofs.  ... 

Signatures and Efficient Proofs on Committed Graphs and NP-Statements [chapter]

Thomas Groß
2015 Lecture Notes in Computer Science  
The graph signature scheme and proofs are a building block for certification systems that need to establish graph properties in zero-knowledge, as encountered in cloud security assurance or provenance.  ...  We propose a graph signature scheme and corresponding proofs that allow a prover (1) to obtain a signature on a committed graph and (2) to subsequently prove to a verifier knowledge of such a graph signature  ...  The obtained graph proof system in itself allows for efficient zero-knowledge proofs of interesting graph properties, such as partitions, connectivity and isolation [23] , which we demonstrate in a cloud  ... 
doi:10.1007/978-3-662-47854-7_18 fatcat:36am56qph5e2lohzsoamxdy27a

Page 1919 of Mathematical Reviews Vol. , Issue 92d [page]

1992 Mathematical Reviews  
Here we find proofs for finite #-determinacy of isolated singularities of functions, and for finite % -determinacy of isolated singularities of complete intersections.  ...  A discussion of the resolution of simple singularities in C> follows (no proof is given that surface singularities can be resolved, though), and leads to five (of more than twenty, to the reviewer’s knowledge  ... 

Multi-prover Interactive Proofs: Unsound Foundations [chapter]

Claude Crépeau, Nan Yang
2017 Lecture Notes in Computer Science  
This paper outlines the lack of isolation and numerous other issues found in the (ZK)MIP literature. A follow-up paper will resolve most of these issues in detail.  ...  Furthermore, some existing Zero-Knowledge MIPs suffer from a catastrophic flaw: they outright allow the Provers to communicate via the Verifier.  ...  Phan and Moti Yung for inviting us to submit our work here. Special thanks to Justin Holmgren (MIT) for pointing out an incorrect/unclear statement at the end of Section 3.3 which is now corrected.  ... 
doi:10.1007/978-3-319-61273-7_25 fatcat:bcp5gykhfvcfhhigpw6wravsyi

Verifier Non-Locality in Interactive Proofs [article]

Claude Crépeau, Nan Yang
2019 arXiv   pre-print
In multi-prover interactive proofs, the verifier interrogates the provers and attempts to steal their knowledge. Other than that, the verifier's role has not been studied.  ...  Existing MIPs' proofs of soundness implicitly depend on the fact that the verifier is not a non-local resource provider.  ...  Christian Schaffner for various discussions about earlier versions of this work.  ... 
arXiv:1804.02724v4 fatcat:yxqq465g7jhszic54b6on77c2e

Page 7261 of Mathematical Reviews Vol. , Issue 97K [page]

1997 Mathematical Reviews  
The notion of witness indistinguishable proofs of knowledge was introduced by U. Feige and A.  ...  A general method is presented that transforms honest verifier zero-knowledge proof systems into witness indistinguishable proof systems.  ... 

Distributed user identification by zero-knowledge access rights proving

Josep Domingo-Ferrer
1991 Information Processing Letters  
Rights possession proofs are zero-knowledge and simvltaneous.  ...  ., Distributed user identification by zero-knowledge access rights proving, Information Processing Letters 40 (1991) 235-239.  ...  The proof can be zero-knowledge and, no matter the ryalue of n, it consists of simultaneously prolying knowledge oft logarithms.  ... 
doi:10.1016/0020-0190(91)90116-y fatcat:5jg6p3oeq5gapmzwrcgs367wua

Secure Authentication: Eliminating Possible Backdoors in Client-Server Endorsement

Jai Prakash Jyotiyana, Arun Mishra
2016 Procedia Computer Science  
The approach includes two steps; first, verify whether authentication system is temper proof. Second, is to separate execution of authentication system from other applications running on server.  ...  This type of system suffers from weak authentication and is open with vulnerabilities. An adversary can take advantage of these vulnerabilities as backdoors.  ...  Traditional such systems have lot of possibility of having some vulnerability. The Zero knowledge proofs (ZKP) [1] involves two parties: the Prover and the Verifier.  ... 
doi:10.1016/j.procs.2016.05.227 fatcat:ev3zibecofacflnq7x2kgdldwm

Spatial Isolation Implies Zero Knowledge Even in a Quantum World

Alessandro Chiesa, Michael Forbes, Tom Gur, Nicholas Spooner
2018 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)  
Our proof consists of constructing a zero knowledge interactive PCP with a strong algebraic structure, and then lifting it to the MIP * model.  ...  Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al.  ...  to include his proof of Theorem 7.2.  ... 
doi:10.1109/focs.2018.00077 dblp:conf/focs/ChiesaFGS18 fatcat:jyne7j2avbabxkyxlhyiwxtyam

Spatial Isolation Implies Zero Knowledge Even in a Quantum World [article]

Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner
2018 arXiv   pre-print
Our proof consists of constructing a zero knowledge interactive PCP with a strong algebraic structure, and then lifting it to the MIP* model.  ...  Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al.  ...  to include his proof of Theorem 7.2.  ... 
arXiv:1803.01519v1 fatcat:qpwt35jmt5fa3n3mpgor5oougi

Page 463 of Journal of Engineering Mathematics Vol. 38, Issue 4 [page]

2000 Journal of Engineering Mathematics  
Then, if 0’ 2(x) and a hy, (x) are well-behaved at infinity, M G(a) = > Hy, (a) + 0 (|aj|-¥) m=! asd; > Od. Proof.  ...  Conventional functions with isolated singularities are not uncommon. The relation between the behaviour of the Fourier transform and the singularities is a matter of some interest.  ... 

Non-Locality in Interactive Proofs [article]

Claude Crépeau, Nan Yang
2019 arXiv   pre-print
A new property of zero-knowledge emerges naturally as a result by also quantifying the non-locality of the simulator.  ...  We make explicit the verifier contamination problem, and identify a solution by constructing a generalization of the MIP model.  ...  Schaffner, and T. Vidick for various discussions about earlier versions of this work. We would also like to thank Jeremy Clark for his insightful comments.  ... 
arXiv:1801.04598v4 fatcat:6jdjj276afaiblo2v36nztri6e
« Previous Showing results 1 — 15 out of 119,563 results