1. Optimally Sound Sigma Protocols Under DCRA
Helger Lipmaa
[View PDF on fc17.ifca.ai]

@inproceedings{DBLP:conf/fc/Lipmaa17,
author = {Helger Lipmaa},
editor = {Aggelos Kiayias},
title = {Optimally Sound Sigma Protocols Under {DCRA}},
booktitle = {Financial Cryptography and Data Security - 21st International Conference,
{FC} 2017, Sliema, Malta, April 3-7, 2017, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10322},
pages = {182--203},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-70972-7\_10},
doi = {10.1007/978-3-319-70972-7\_10},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/bib/conf/fc/Lipmaa17},
bibsource = {dblp computer science bibliography, https://dblp.org}
}

Given a well-chosen additively homomorphic cryptosystem and a Σ protocol with a linear answer, Damgård, Fazio, and Nicolosi proposed a non-interactive designated-verifier zero knowledge argument in the registered public key model that is sound under non-standard complexity-leveraging assumptions. In 2015, Chaidos and Groth showed how to achieve the weaker yet reasonable culpable soundness notion under standard assumptions but only if the plaintext space order is prime. It makes use of Σ protocols that satisfy what we call the \emph{optimal culpable soundness}. Unfortunately, most of the known additively homomorphic cryptosystems (like the Paillier Elgamal cryptosystem that is secure under the standard Decisional Composite Residuosity Assumption) have composite-order plaintext space. We construct optimally culpable sound Σ protocols and thus culpably sound non-interactive designated-verifier zero knowledge protocols for NP under standard assumptions given that the least prime divisor of the plaintext space order is large.

1.