Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Spooner, Nicholas"'
We construct perfect zero-knowledge probabilistically checkable proofs (PZK-PCPs) for every language in #P. This is the first construction of a PZK-PCP for any language outside BPP. Furthermore, unlike previous constructions of (statistical) zero-kno
Externí odkaz:
http://arxiv.org/abs/2403.11941
We prove a tight parallel repetition theorem for $3$-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of $4$-message c
Externí odkaz:
http://arxiv.org/abs/2311.10681
A major difficulty in quantum rewinding is the fact that measurement is destructive: extracting information from a quantum state irreversibly changes it. This is especially problematic in the context of zero-knowledge simulation, where preserving the
Externí odkaz:
http://arxiv.org/abs/2111.12257
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the post-quantum har
Externí odkaz:
http://arxiv.org/abs/2103.08140
Zero knowledge plays a central role in cryptography and complexity. The seminal work of Ben-Or et al. (STOC 1988) shows that zero knowledge can be achieved unconditionally for any language in NEXP, as long as one is willing to make a suitable physica
Externí odkaz:
http://arxiv.org/abs/1803.01519
Many seminal results in Interactive Proofs (IPs) use algebraic techniques based on low-degree polynomials, the study of which is pervasive in theoretical computer science. Unfortunately, known methods for endowing such proofs with zero knowledge guar
Externí odkaz:
http://arxiv.org/abs/1704.02086
Autor:
Ben-Sasson, Eli, Chiesa, Alessandro, Forbes, Michael A., Gabizon, Ariel, Riabzev, Michael, Spooner, Nicholas
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive PCPs (IPCP
Externí odkaz:
http://arxiv.org/abs/1610.03798
Autor:
Spooner, Nicholas A.
Publikováno v:
Quest Full Text.
Thesis (M.App.Sc.) - Carleton University, 2007.
Includes bibliographical references (p. 82-89). Also available in electronic format on the Internet.
Includes bibliographical references (p. 82-89). Also available in electronic format on the Internet.
Externí odkaz:
http://proxy.library.carleton.ca/login?url=http://wwwlib.umi.com/cr/carleton/fullcit?pMR23349
Publikováno v:
Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-44, 44p
Autor:
Dall'Agnol, Marcel, Spooner, Nicholas
Collapse binding and collapsing were proposed by Unruh (Eurocrypt '16) as post-quantum strengthenings of computational binding and collision resistance, respectively. These notions have been very successful in facilitating the "lifting" of classical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbfc3384bea00507146f8bae546b9a0d