Search results for "public-coin"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
124	Chun-Yuan Hsiao, Leonid Reyzin	Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins?	CRYPTO	2004	DBLP DOI BibTeX RDF
123	Yunlei Zhao, Chan H. Lee, Yiming Zhao, Hong Zhu 0004	Some Observations on Zap and Its Applications.	ACNS	2004	DBLP DOI BibTeX RDF	Zap, public-coin honest verifier zero-knowledge, deniable authentication, timed commitment, witness indistinguishability
82	Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer	Magic Functions.	J. ACM	2003	DBLP DOI BibTeX RDF	Fiat-Shamir methodology, interactive argument, magic function, selective decommitment, Digital signature, zero knowledge, interactive proof system
82	Cynthia Dwork, Moni Naor, Omer Reingold, Larry J. Stockmeyer	Magic Functions.	FOCS	1999	DBLP DOI BibTeX RDF	interactive argument, magic function, selective decommitment, three-round protocol, cryptography, distributed computing, zero knowledge, complexity theory, signature scheme, commitment scheme
75	Ivan Damgård, Oded Goldreich 0001, Tatsuaki Okamoto, Avi Wigderson	Honest Verifier vs Dishonest Verifier in Public Coin Zero-Knowledge Proofs.	CRYPTO	1995	DBLP DOI BibTeX RDF
68	Krzysztof Pietrzak, Johan Sjödin	Weak Pseudorandom Functions in Minicrypt.	ICALP (2)	2008	DBLP DOI BibTeX RDF
65	Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick	Using Entanglement in Quantum Multi-prover Interactive Proofs.	CCC	2008	DBLP DOI BibTeX RDF	quantum interactive proofs, public-coin, parallelization, entanglement
55	Lance Fortnow, Carsten Lund	Interactive Proof Systems and Alternating Time-Space Complexity.	STACS	1991	DBLP DOI BibTeX RDF
55	Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström	On the Composition of Public-Coin Zero-Knowledge Protocols.	CRYPTO	2009	DBLP DOI BibTeX RDF
48	Satoshi Hada	Zero-Knowledge and Code Obfuscation.	ASIACRYPT	2000	DBLP DOI BibTeX RDF
47	Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum	Delegating computation: interactive proofs for muggles.	STOC	2008	DBLP DOI BibTeX RDF	muggles, delegation, interactive proofs
45	Rafael Pass, Muthuramakrishnan Venkitasubramaniam	An efficient parallel repetition theorem for Arthur-Merlin games.	STOC	2007	DBLP DOI BibTeX RDF	computationally-sound arguments, public-coin protocols, proofs of knowledge, Arthur-Merlin games, parallel repetition
41	Andrew Chi-Chih Yao	On the power of quantum fingerprinting.	STOC	2003	DBLP DOI BibTeX RDF	public coin, quantum protocol, simultaneous message model, computational complexity, communication complexity
41	Paul Beame, Matei David, Toniann Pitassi, Philipp Woelfel	Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity.	ICALP	2007	DBLP DOI BibTeX RDF
41	Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano	Randomness-Optimal Characterization of Two NP Proof Systems.	RANDOM	2002	DBLP DOI BibTeX RDF
38	Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick	Using Entanglement in Quantum Multi-Prover Interactive Proofs.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Subject classification. 03D15, 81P68, 68Q15, 68Q10
34	Maciej Liskiewicz	Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes.	STACS	1997	DBLP DOI BibTeX RDF
28	Jens Groth	Linear Algebra with Sub-linear Zero-Knowledge Arguments.	CRYPTO	2009	DBLP DOI BibTeX RDF	Sub-linear size zero-knowledge arguments, public-coin special honest verifier zero-knowledge, Pedersen commitments, linear algebra, circuit satisfiability
27	Hirotada Kobayashi	General Properties of Quantum Zero-Knowledge Proofs.	TCC	2008	DBLP DOI BibTeX RDF
27	Rahul Jain 0001, Hartmut Klauck, Ashwin Nayak 0001	Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract.	STOC	2008	DBLP DOI BibTeX RDF	rectangle bounds, subdistribution bounds, information theory, communication complexity, direct product
27	Hoeteck Wee	On Round-Efficient Argument Systems.	ICALP	2005	DBLP DOI BibTeX RDF
27	Shafi Goldwasser, Yael Tauman Kalai	On the (In)security of the Fiat-Shamir Paradigm.	FOCS	2003	DBLP DOI BibTeX RDF
27	Oded Goldreich 0001, Salil P. Vadhan	Comparing Entropies in Statistical Zero Knowledge with Applications to the Structure of SZK.	CCC	1999	DBLP DOI BibTeX RDF	Statistical Zero-Knowledge Proofs, Universal Hashing, Arthur-Merlin Games
27	Giovanni Di Crescenzo, Tatsuaki Okamoto, Moti Yung	Keeping the SZK-Verifier Honest Unconditionally.	CRYPTO	1997	DBLP DOI BibTeX RDF
27	Satyanarayana V. Lokam, Meena Mahajan, V. Vinay	Logspace Verifiers, NC, and NP.	ISAAC	1995	DBLP DOI BibTeX RDF
24	Salil P. Vadhan	An Unconditional Study of Computational Zero Knowledge.	FOCS	2004	DBLP DOI BibTeX RDF
24	Tatsuaki Okamoto	An Extensin of Zero-Knowledge Proofs and Its Applications.	ASIACRYPT	1991	DBLP DOI BibTeX RDF
21	Cody Freitag, Omer Paneth, Rafael Pass	Public-Coin, Complexity-Preserving, Succinct Arguments of Knowledge for NP from Collision-Resistance.	EUROCRYPT (4)	2024	DBLP DOI BibTeX RDF
21	Alexandre Belling, Azam Soleimanian, Olivier Bégassat	Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification.	CCS	2023	DBLP DOI BibTeX RDF
21	Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani	On public-coin zero-error randomized communication complexity.	Inf. Process. Lett.	2022	DBLP DOI BibTeX RDF
21	Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede	Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Susumu Kiyoshima	Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Alexandre Belling, Azam Soleimanian, Olivier Bégassat	Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
21	Cyprien Delpech de Saint Guilhem, Emmanuela Orsini, Titouan Tanguy, Michiel Verbauwhede	Efficient Proof of RAM Programs from Any Public-Coin Zero-Knowledge System.	SCN	2022	DBLP DOI BibTeX RDF
21	Susumu Kiyoshima	Public-Coin 3-Round Zero-Knowledge from Learning with Errors and Keyless Multi-Collision-Resistant Hash.	CRYPTO (1)	2022	DBLP DOI BibTeX RDF
21	Inbar Kaslasi, Ron Rothblum, Prashant Nalini Vasudevan	Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
21	Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani	On public-coin zero-error randomized communication complexity.	Electron. Colloquium Comput. Complex.	2021	DBLP BibTeX RDF
21	Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan	Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
21	Gal Arnon, Guy N. Rothblum	On Prover-Efficient Public-Coin Emulation of Interactive Proofs.	ITC	2021	DBLP DOI BibTeX RDF
21	Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan	Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers.	EUROCRYPT (3)	2021	DBLP DOI BibTeX RDF
21	Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni	Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
21	Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni	Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.	TCC (2)	2020	DBLP DOI BibTeX RDF
21	Gal Arnon, Guy N. Rothblum	On Prover-Efficient Public-Coin Emulation of Interactive Proofs.	Electron. Colloquium Comput. Complex.	2019	DBLP BibTeX RDF
21	Zhenbin Yan 0001, Yi Deng 0002	A novel approach to public-coin concurrent zero-knowledge and applications on resettable security.	Sci. China Inf. Sci.	2019	DBLP DOI BibTeX RDF
21	Dongxue Pan, Bei Liang, Hongda Li 0001, Peifang Ni	Public-Coin Differing-Inputs Obfuscator for Hiding-Input Point Function with Multi-bit Output and Its Applications.	INDOCRYPT	2019	DBLP DOI BibTeX RDF
21	Rahul Jain 0001, Attila Pereszlényi, Penghui Yao	A Direct Product Theorem for Two-Party Bounded-Round Public-Coin Communication Complexity.	Algorithmica	2016	DBLP DOI BibTeX RDF
21	Yi Deng 0002, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung	On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.	SCN	2016	DBLP DOI BibTeX RDF
21	Kai-Min Chung, Rafael Pass	Tight Parallel Repetition Theorems for Public-Coin Arguments using KL-divergence.	IACR Cryptol. ePrint Arch.	2015	DBLP BibTeX RDF
21	Kai-Min Chung, Rafael Pass	Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence.	TCC (2)	2015	DBLP DOI BibTeX RDF
21	Yuval Ishai, Omkant Pandey, Amit Sahai	Public-Coin Differing-Inputs Obfuscation and Its Applications.	TCC (2)	2015	DBLP DOI BibTeX RDF
21	Yuval Ishai, Omkant Pandey, Amit Sahai	Public-Coin Differing-Inputs Obfuscation and Its Applications.	IACR Cryptol. ePrint Arch.	2014	DBLP BibTeX RDF
21		Public-Coin Concurrent Zero-Knowledge in Logarithmic Rounds.	IACR Cryptol. ePrint Arch.	2014	DBLP BibTeX RDF
21	Ning Ding 0001	Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge.	Inscrypt	2014	DBLP DOI BibTeX RDF
21	Takahiro Matsuda 0002	On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations.	TCC	2014	DBLP DOI BibTeX RDF
21	Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng	Public-Coin Parallel Zero-Knowledge for NP.	J. Cryptol.	2013	DBLP DOI BibTeX RDF
21	Ran Canetti, Huijia Lin, Omer Paneth	Public-Coin Concurrent Zero-Knowledge in the Global Hash Model.	TCC	2013	DBLP DOI BibTeX RDF
21	Rahul Jain 0001, Attila Pereszlényi, Penghui Yao	A direct product theorem for bounded-round public-coin randomized communication complexity	CoRR	2012	DBLP BibTeX RDF
21	Yi Deng 0002, Juan A. Garay, San Ling, Huaxiong Wang, Moti Yung	On the (Im)Plausibility of Constant-Round Public-Coin Straight-Line-Simulatable Zero-Knowledge Proofs.	IACR Cryptol. ePrint Arch.	2012	DBLP BibTeX RDF
21	Rahul Jain 0001, Attila Pereszlényi, Penghui Yao	A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity.	FOCS	2012	DBLP DOI BibTeX RDF
21	Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikström	On the Composition of Public-Coin Zero-Knowledge Protocols.	SIAM J. Comput.	2011	DBLP DOI BibTeX RDF
21	Rahul Jain 0001	Strong direct product conjecture holds for all relations in public coin randomized one-way communication complexity	CoRR	2010	DBLP BibTeX RDF
21	Rahul Jain 0001	A strong direct product theorem for two-way public coin communication complexity	CoRR	2010	DBLP BibTeX RDF
21	Kai-Min Chung, Feng-Hao Liu	Tight Parallel Repetition Theorems for Public-coin Arguments.	Electron. Colloquium Comput. Complex.	2009	DBLP BibTeX RDF
21	Yunlei Zhao, Jesper Buus Nielsen, Robert H. Deng, Dengguo Feng	Generic yet Practical ZK Arguments from any Public-Coin HVZK	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
21	Dmitry Gavinsky, Julia Kempe, Ronald de Wolf	Quantum Communication Cannot Simulate a Public Coin	CoRR	2004	DBLP BibTeX RDF
21	Daniele Micciancio, Erez Petrank	Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol	Electron. Colloquium Comput. Complex.	2002	DBLP BibTeX RDF
21	Daniele Micciancio, Erez Petrank	Efficient and Concurrent Zero-Knowledge from any public coin HVZK protocol.	IACR Cryptol. ePrint Arch.	2002	DBLP BibTeX RDF
20	Daniele Micciancio, Erez Petrank	Simulatable Commitments and Efficient Concurrent Zero-Knowledge.	EUROCRYPT	2003	DBLP DOI BibTeX RDF
17	Yi Deng 0002, Dongdai Lin	Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability.	EUROCRYPT	2007	DBLP DOI BibTeX RDF	instance-dependent verifiable random functions, simultaneous resettability, zero knowledge
17	Ivan Damgård, Nelly Fazio, Antonio Nicolosi	Non-interactive Zero-Knowledge from Homomorphic Encryption.	TCC	2006	DBLP DOI BibTeX RDF
14	Iftach Haitner, Alon Rosen, Ronen Shaltiel	On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols.	TCC	2009	DBLP DOI BibTeX RDF	Witness-Hiding, Arthur Merlin protocols, Zero-Knowledge, Black-box reductions
14	Yael Tauman Kalai, Ran Raz	Probabilistically Checkable Arguments.	CRYPTO	2009	DBLP DOI BibTeX RDF
14	Lior Malka	How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge.	TCC	2008	DBLP DOI BibTeX RDF	non-interactive, perfect zero-knowledge, error shifting, complete problems, cryptography, perfect simulation
14	Boaz Barak, Yehuda Lindell, Salil P. Vadhan	Lower Bounds for Non-Black-Box Zero Knowledge.	FOCS	2003	DBLP DOI BibTeX RDF
14	John Watrous	imits on the Power of Quantum Statistical Zero-Knowledge.	FOCS	2002	DBLP DOI BibTeX RDF
14	Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu 0004	Reduction Zero-Knowledge.	SCN	2002	DBLP DOI BibTeX RDF	zap, zero-knowledge, bit commitment, non-interactive zero-knowledge, witness indistinguishability
14	Cynthia Dwork, Larry J. Stockmeyer	2-round zero knowledge and proof auditors.	STOC	2002	DBLP DOI BibTeX RDF	advice bound, timed protocol, zap, cryptography, zero knowledge, interactive proof systems
14	Ronald Cramer, Ivan Damgård	Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation.	EUROCRYPT	1997	DBLP DOI BibTeX RDF