Pairing-based non-interactive zero-knowledge arguments and applications

Elliptic curves with a bilinear map, or pairing, have a rich algebraic structure that has been fundamental to develop practical Non-Interactive Zero-Knowledge (NIZK) proofs. On the theoretical side, we explore how efficient can NIZK proofs be under weak complexity assumptions. Specifically, we reduc...

ver descrição completa

Detalhes bibliográficos
Autor: Pindado, Zaira
Formato: tesis doctoral
Estado:Versión publicada
Fecha de publicación:2021
País:España
Recursos:CBUC, CESCA
Repositorio:TDR. Tesis Doctorales en Red
OAI Identifier:oai:www.tdx.cat:10803/671270
Acesso em linha:http://hdl.handle.net/10803/671270
Access Level:acceso abierto
Palavra-chave:Pairing-based cryptography
Non-interactive zero-knowledge proofs
Cryptographic protocols
Criptografia basada en pairings
Proves de zero coneixement no interactives
Protocols criptogràfics
62
id ES_fd171fc57dbfda6bf282200bcb2cba6b
oai_identifier_str oai:www.tdx.cat:10803/671270
network_acronym_str ES
network_name_str España
repository_id_str
spelling Pairing-based non-interactive zero-knowledge arguments and applicationsPindado, ZairaPairing-based cryptographyNon-interactive zero-knowledge proofsCryptographic protocolsCriptografia basada en pairingsProves de zero coneixement no interactivesProtocols criptogràfics62Elliptic curves with a bilinear map, or pairing, have a rich algebraic structure that has been fundamental to develop practical Non-Interactive Zero-Knowledge (NIZK) proofs. On the theoretical side, we explore how efficient can NIZK proofs be under weak complexity assumptions. Specifically, we reduce the cost of proofs of satisfiability of quadratic equations, we define a new commitment scheme that is compatible with other pairing-based NIZK arguments, and we construct a simulation-sound argument that results in a new a signature of knowledge with communication sublinear in the circuit size under standard assumptions. Additionally, we study how to reduce the cost of verification in one of the most widely deployed NIZK arguments in practice.Les corbes el·líptiques amb una aplicació bilineal, o pairing, tenen una estructura algebraica molt rica que ha sigut fonamental per desenvolupar proves de zero coneixement no interactives (NIZK). En la banda teòrica, explorem quant eficients poden ser les proves NIZK sota hipòtesis de complexitat dèbils. Més concretament, reduïm el cost de les proves de satisfacció per equacions quadràtiques, definim un nou esquema de compromís que és compatible amb altres proves NIZK basades en pairings i construïm una prova que resulta en una nova signatura de coneixement amb una comunicació sublineal en la mida del circuit sota hipòtesis estàndards. A més, estudiem com es redueix el cost de verificació en una de les proves NIZK més desenvolupades a la pràctica.Programa de doctorat en Tecnologies de la Informació i les ComunicacionsUniversitat Pompeu FabraRàfols, CarlaUniversitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions202120212021info:eu-repo/semantics/doctoralThesisinfo:eu-repo/semantics/publishedVersion188 p.application/pdfapplication/pdfhttp://hdl.handle.net/10803/671270TDX (Tesis Doctorals en Xarxa)reponame:TDR. Tesis Doctorales en Redinstname:CBUC, CESCAInglésL'accés als continguts d'aquesta tesi queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons: http://creativecommons.org/licenses/by-nc-sa/4.0/http://creativecommons.org/licenses/by-nc-sa/4.0/info:eu-repo/semantics/openAccessoai:www.tdx.cat:10803/6712702026-06-14T12:46:07Z
dc.title.none.fl_str_mv Pairing-based non-interactive zero-knowledge arguments and applications
title Pairing-based non-interactive zero-knowledge arguments and applications
spellingShingle Pairing-based non-interactive zero-knowledge arguments and applications
Pindado, Zaira
Pairing-based cryptography
Non-interactive zero-knowledge proofs
Cryptographic protocols
Criptografia basada en pairings
Proves de zero coneixement no interactives
Protocols criptogràfics
62
title_short Pairing-based non-interactive zero-knowledge arguments and applications
title_full Pairing-based non-interactive zero-knowledge arguments and applications
title_fullStr Pairing-based non-interactive zero-knowledge arguments and applications
title_full_unstemmed Pairing-based non-interactive zero-knowledge arguments and applications
title_sort Pairing-based non-interactive zero-knowledge arguments and applications
dc.creator.none.fl_str_mv Pindado, Zaira
author Pindado, Zaira
author_facet Pindado, Zaira
author_role author
dc.contributor.none.fl_str_mv Ràfols, Carla
Universitat Pompeu Fabra. Departament de Tecnologies de la Informació i les Comunicacions
dc.subject.none.fl_str_mv Pairing-based cryptography
Non-interactive zero-knowledge proofs
Cryptographic protocols
Criptografia basada en pairings
Proves de zero coneixement no interactives
Protocols criptogràfics
62
topic Pairing-based cryptography
Non-interactive zero-knowledge proofs
Cryptographic protocols
Criptografia basada en pairings
Proves de zero coneixement no interactives
Protocols criptogràfics
62
description Elliptic curves with a bilinear map, or pairing, have a rich algebraic structure that has been fundamental to develop practical Non-Interactive Zero-Knowledge (NIZK) proofs. On the theoretical side, we explore how efficient can NIZK proofs be under weak complexity assumptions. Specifically, we reduce the cost of proofs of satisfiability of quadratic equations, we define a new commitment scheme that is compatible with other pairing-based NIZK arguments, and we construct a simulation-sound argument that results in a new a signature of knowledge with communication sublinear in the circuit size under standard assumptions. Additionally, we study how to reduce the cost of verification in one of the most widely deployed NIZK arguments in practice.
publishDate 2021
dc.date.none.fl_str_mv 2021
2021
2021
dc.type.none.fl_str_mv info:eu-repo/semantics/doctoralThesis
info:eu-repo/semantics/publishedVersion
format doctoralThesis
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10803/671270
url http://hdl.handle.net/10803/671270
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.rights.none.fl_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
info:eu-repo/semantics/openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 188 p.
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Universitat Pompeu Fabra
publisher.none.fl_str_mv Universitat Pompeu Fabra
dc.source.none.fl_str_mv TDX (Tesis Doctorals en Xarxa)
reponame:TDR. Tesis Doctorales en Red
instname:CBUC, CESCA
instname_str CBUC, CESCA
reponame_str TDR. Tesis Doctorales en Red
collection TDR. Tesis Doctorales en Red
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869425508354097152
score 15,301603

Registos relacionados