Efficient zero-knowledge arguments for arithmetic circuits in the discrete log settingReportar como inadecuado




Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Reference: Bootle, J, Cerulli, A, Chaidos, P et al., (2016). Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting. Annual International Conference on the Theory and Applications of Cryptographic Techniques: EUROCRYPT 2016: Advances in Cryptology, 9666, 327-357.Citable link to this page:

 

Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting Series: Lecture Notes in Computer Science

Abstract: We provide a zero-knowledge argument for arithmetic circuit satisfiability with a communication complexity that grows logarithmically in the size of the circuit. The round complexity is also logarithmic and for an arithmetic circuit with fan-in 2 gates the computation of the prover and verifier is linear in the size of the circuit. The soundness of our argument relies solely on the well-established discrete logarithm assumption in prime order groups. At the heart of our new argument system is an efficient zeroknowledge argument of knowledge of openings of two Pedersen multicommitments satisfying an inner product relation, which is of independent interest. The inner product argument requires logarithmic communication, logarithmic interaction and linear computation for both the prover and the verifier. We also develop a scheme to commit to a polynomial and later reveal the evaluation at an arbitrary point, in a verifiable manner. This is used to build an optimized version of the constant round square root complexity argument of Groth (CRYPTO 2009), which reduces both communication and round complexity.

Publication status:PublishedPeer Review status:Peer reviewedVersion:Accepted Manuscript Funder: European ResearchCouncil   Funder: Engineering and Physical Sciences Research Council   Notes:Copyright © 2016 International Association for Cryptologic Research. This is the accepted manuscript version of the conference paper. The final version is available online from Springer at: https://doi.org/10.1007/978-3-662-49896-5_12

Bibliographic Details

Publisher: Springer, Berlin, Heidelberg

Publisher Website: http://www.springer.com/

Series: Lecture Notes in Computer Science

Host: Annual International Conference on the Theory and Applications of Cryptographic Techniques: EUROCRYPT 2016: Advances in Cryptologysee more from them

Publication Website: http://link.springer.com/book/10.1007/978-3-662-49896-5

Volume: 9666

Extent: 327-357

Issue Date: 2016

pages:327-357Identifiers

Doi: https://doi.org/10.1007/978-3-662-49896-5_12

Eissn: 1611-3349

Isbn: 9783662498958

Issn: 0302-9743

Uuid: uuid:2f919864-a097-48ce-9a28-2b9dc3e6382d

Urn: uri:2f919864-a097-48ce-9a28-2b9dc3e6382d

Pubs-id: pubs:623264 Item Description

Type: conference-proceeding;

Version: Accepted ManuscriptKeywords: sigma-protoco zero-knowledge argument arithmetic circuit discrete logarithm assumption

Relationships





Autor: Bootle, J - - - Cerulli, A - - - Chaidos, P - - - Groth, J - - - Petit, C - Oxford, MPLS, Mathematical Institute - - - - Bibliogr

Fuente: https://ora.ox.ac.uk/objects/uuid:2f919864-a097-48ce-9a28-2b9dc3e6382d



DESCARGAR PDF




Documentos relacionados