×

Found 12 Documents (Results 1–12)

Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II. (English) Zbl 1521.94028

Kiltz, Eike (ed.) et al., Theory of cryptography. 20th international conference, TCC 2022, Chicago, IL, USA, November 7–10, 2022. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 13747, 467-496 (2023).
MSC:  94A60 94B05 81P94
PDFBibTeX XMLCite
Full Text: DOI

Linear-size constant-query IOPs for delegating computation. (English) Zbl 1455.94123

Hofheinz, Dennis (ed.) et al., Theory of cryptography. 17th international conference, TCC 2019, Nuremberg, Germany, December 1–5, 2019. Proceedings. Part II. Cham: Springer. Lect. Notes Comput. Sci. 11892, 494-521 (2019).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI Link

Fast Reed-Solomon interactive oracle proofs of proximity. (English) Zbl 1499.68141

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 14, 17 p. (2018).
PDFBibTeX XMLCite
Full Text: DOI

Worst-case to average case reductions for the distance to a code. (English) Zbl 1441.68035

Servedio, Rocco A. (ed.), 33rd computational complexity conference, CCC 2018, June 22–24, 2018, San Diego, California, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 102, Article 24, 23 p. (2018).
MSC:  68P30 94B05
PDFBibTeX XMLCite
Full Text: DOI

Computational integrity with a public random string from quasi-linear PCPs. (English) Zbl 1415.94409

Coron, Jean-Sébastien (ed.) et al., Advances in cryptology – EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 – May 4, 2017. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 10212, 551-579 (2017).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Interactive oracle proofs. (English) Zbl 1397.94048

Hirt, Martin (ed.) et al., Theory of cryptography. 14th international conference, TCC 2016-B, Beijing, China, October 31 – November 3, 2016, Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-53643-8/pbk; 978-3-662-53644-5/ebook). Lecture Notes in Computer Science 9986, 31-60 (2016).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

Quasi-linear size zero knowledge from linear-algebraic PCPs. (English) Zbl 1375.94101

Kushilevitz, Eyal (ed.) et al., Theory of cryptography. 13th international conference, TCC 2016-A, Tel Aviv, Israel, January 10–13, 2016. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-49098-3/pbk; 978-3-662-49099-0/ebook). Lecture Notes in Computer Science 9563, 33-64 (2016).
MSC:  94A60 68Q15
PDFBibTeX XMLCite
Full Text: DOI

Limits on the rate of locally testable affine-invariant codes. (English) Zbl 1343.68288

Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 412-423 (2011).
MSC:  68W20 94B60
PDFBibTeX XMLCite
Full Text: DOI

On sums of locally testable affine invariant properties. (English) Zbl 1343.68287

Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 400-411 (2011).
MSC:  68W20 11T71
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software