Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Bootle, Jonathan"'
The sumcheck protocol, introduced in 1992, is an interactive proof which is a key component of many probabilistic proof systems in computational complexity theory and cryptography, some of which have been deployed. However, none of these proof system
Externí odkaz:
http://arxiv.org/abs/2402.06093
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Baum, Carsten, Lyubashevsky, Vadim, Groth, Jens, Bootle, Jonathan, Cerulli, Andrea, del Pino, Rafael
Publikováno v:
Baum, C, Lyubashevsky, V, Groth, J, Bootle, J, Cerulli, A & del Pino, R 2018, Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits . in CRYPTO 2018: Advances in Cryptology . https://doi.org/10.1007/978-3-319-96881-0_23
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::0c00748ab62c205e363c4499a90c4b29
https://pure.au.dk/portal/da/publications/sublinear-latticebased-zeroknowledge-arguments-for-arithmetic-circuits(375386e3-c4b5-448a-9b3d-5f3de2d6eb92).html
https://pure.au.dk/portal/da/publications/sublinear-latticebased-zeroknowledge-arguments-for-arithmetic-circuits(375386e3-c4b5-448a-9b3d-5f3de2d6eb92).html
Publikováno v:
Advances in Cryptology - EUROCRYPT 2016: 35th Annual International Conference on the Theory & Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II; 2016, p327-357, 31p
Publikováno v:
Applied Cryptography & Network Security (9783319395548); 2016, p117-136, 20p
Publikováno v:
Foundations of Security Analysis & Design VIII; 2016, p1-31, 31p
Autor:
Bootle, Jonathan, Cerulli, Andrea, Chaidos, Pyrros, Ghadafi, Essam, Groth, Jens, Petit, Christophe
Publikováno v:
Computer Security - ESORICS 2015: 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I; 2015, p243-265, 23p
Interactive oracle proofs (IOPs) are a multi-round generalization of probabilistically checkable proofs that play a fundamental role in the construction of efficient cryptographic proofs.
We present an IOP that simultaneously achieves the proper
We present an IOP that simultaneously achieves the proper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::bef83d7d590ddafe03c630d6b62b419c
https://infoscience.epfl.ch/record/295906
https://infoscience.epfl.ch/record/295906
We introduce a new class of succinct arguments, that we call elastic. Elastic SNARKs allow the prover to allocate different resources (such as memory and time) depending on the execution environment and the statement to prove. The resulting output is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______185::6e48991348ed1210d3a376cebb2b622c
https://infoscience.epfl.ch/record/295907
https://infoscience.epfl.ch/record/295907