Signatures of Knowledge for Boolean Circuits Under Standard Assumptions

This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size [Formula: see text] bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation so...

Descripción completa

Detalles Bibliográficos
Autores principales: Baghery, Karim, González, Alonso, Pindado, Zaira, Ràfols, Carla
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7334997/
http://dx.doi.org/10.1007/978-3-030-51938-4_2
_version_ 1783554047996854272
author Baghery, Karim
González, Alonso
Pindado, Zaira
Ràfols, Carla
author_facet Baghery, Karim
González, Alonso
Pindado, Zaira
Ràfols, Carla
author_sort Baghery, Karim
collection PubMed
description This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size [Formula: see text] bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of González and Ràfols (ASIACRYPT’19) with very small overhead. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives.
format Online
Article
Text
id pubmed-7334997
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73349972020-07-06 Signatures of Knowledge for Boolean Circuits Under Standard Assumptions Baghery, Karim González, Alonso Pindado, Zaira Ràfols, Carla Progress in Cryptology - AFRICACRYPT 2020 Article This paper constructs unbounded simulation sound proofs for boolean circuit satisfiability under standard assumptions with proof size [Formula: see text] bilinear group elements, where d is the depth and n is the input size of the circuit. Our technical contribution is to add unbounded simulation soundness to a recent NIZK of González and Ràfols (ASIACRYPT’19) with very small overhead. Our new scheme can be used to construct the most efficient Signature-of-Knowledge based on standard assumptions that also can be composed universally with other cryptographic protocols/primitives. 2020-06-06 /pmc/articles/PMC7334997/ http://dx.doi.org/10.1007/978-3-030-51938-4_2 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Baghery, Karim
González, Alonso
Pindado, Zaira
Ràfols, Carla
Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title_full Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title_fullStr Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title_full_unstemmed Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title_short Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
title_sort signatures of knowledge for boolean circuits under standard assumptions
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7334997/
http://dx.doi.org/10.1007/978-3-030-51938-4_2
work_keys_str_mv AT bagherykarim signaturesofknowledgeforbooleancircuitsunderstandardassumptions
AT gonzalezalonso signaturesofknowledgeforbooleancircuitsunderstandardassumptions
AT pindadozaira signaturesofknowledgeforbooleancircuitsunderstandardassumptions
AT rafolscarla signaturesofknowledgeforbooleancircuitsunderstandardassumptions

Ejemplares similares