Abstract
In [18] Cramer, Damgård and Schoenmakers (CDS) devise an OR-composition technique for ∑-protocols that allows to construct highly-efficient proofs for compound statements. Since then, such technique has found countless applications as building block for designing efficient protocols.
Original language | English |
---|---|
Title of host publication | Theory of Cryptography |
Editors | Eyal Kushilevitz, Tal Malkin |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer |
Pages | 112-141 |
Number of pages | 30 |
ISBN (Electronic) | 978-3-662-49099-0 |
ISBN (Print) | 978-3-662-49098-3 |
DOIs | |
Publication status | Published - 2016 |
Event | 13th Theory of Cryptography Conference - Tel Aviv, Israel Duration: 10 Jan 2016 → 13 Jan 2016 https://www.iacr.org/workshops/tcc2016a/index.html |
Conference
Conference | 13th Theory of Cryptography Conference |
---|---|
Abbreviated title | TCC 2016-A |
Country/Territory | Israel |
City | Tel Aviv |
Period | 10/01/16 → 13/01/16 |
Internet address |