Merlin-arthur Protocols
Merlin-Arthur Protocols is a type of interactive proof system in computational complexity theory where a powerful but untrusted prover (Merlin) sends a single message to a probabilistic polynomial-time verifier (Arthur), who then decides whether to accept or reject based on that message and his own random coins.
43
Publications
3.1K
Citations
66
Authors
59
Institutions
Publications per year
2017–2026
3
Variants
Ma
Parents
43
How to go beyond the black-box simulation barrier
Boaz Barak · 2001 · 486 citations
On the Composition of Zero-Knowledge Proof Systems
Oded Goldreich, Hugo Krawczyk · SIAM Journal on Computing · 1996 · 427 citations
Chris Marriott, John Watrous · Computational Complexity · 2005 · 253 citations · Full text
Yi-Kai Liu, Matthias Christandl, Frank Verstraete · Physical Review Letters · 2007 · 217 citations · Full text
Natural Sciences, Chemistry, Physics +17
1–5 of 43
66
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 66
59

Weizmann Institute of Science
Rehovot, Israel
6 h-index
8 publications
759 citations
University of California San Diego
San Diego, United States
3 h-index
4 publications
473 citations
University of Cambridge
Cambridge, United Kingdom
3 h-index
3 publications
360 citations
California Institute of Technology
Pasadena, United States
2 h-index
2 publications
244 citations
Universidade Federal de Minas Gerais
Belo Horizonte, Brazil
2 h-index
2 publications
71 citations
University of Washington
Seattle, United States
2 h-index
2 publications
143 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
3 publications
626 citations
Gunma University
Maebashi, Japan
2 h-index
2 publications
43 citations
1–8 of 59
Repository · 4 publications · 62 citations
4
h-index
CC · 4 publications · 345 citations
4
h-index
QIC · 3 publications · 82 citations
3
h-index
Repository · 2 publications · 38 citations
2
h-index
2 publications · 26 citations
2
h-index
1–5