Thomas Wunderer

Technische Universität Darmstadt
Fachbereich Informatik
Kryptographie und Computeralgebra
Gebäude S2|02
Hochschulstraße 10
64289 Darmstadt
Germany

Raum: S2/02 B209

Tel:  06151/16-20668

Fax: 06151/16-20665

E-Mail: twunderer(a-t)cdc.informatik.tu-darmstadt.de

Implementations

Source code for "Revisiting the Hybrid Attack: Improved Analysis and Refined Security Estimates": undefinedImplementations

Publikations

An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme

Autor Daniel Cabarcas, Denise Demirel, Florian Göpfert, Jean Lancrenon, Thomas Wunderer
Datum Juni 2015
Art Techreport
Keywordsunconditionally hiding commitments, post-quantum, lattice-based cryptography, long-term security, proof of knowledge
SchlüsselTUD-CS-2015-0141
Forschungsgebiete CROSSING, Theoretische Informatik - Kryptographie und Computeralgebra, CASED, Long-term security, Secure Data, Solutions, S6, PRISMACLOUD, Post-Quantum Kryptographie (PQC), P1, Primitives, CYSEC
Abstrakt Commitment schemes are among cryptography's most important building blocks. Besides their basic properties, hidingness and bindingness, for many applications it is important that the schemes applied support proofs of knowledge. However, all existing solutions which have been proven to provide these protocols are only computationally hiding or are not resistant against quantum adversaries. This is not suitable for long-lived systems, such as long-term archives, where commitments have to provide security also in the long run. Thus, in this work we present a new post-quantum unconditionally hiding commitment scheme that supports (statistical) zero-knowledge protocols and allows to refreshes the binding property over time. The bindingness of our construction relies on the approximate shortest vector problem, a lattice problem which is conjectured to be hard for polynomial approximation factors, even for a quantum adversary. Furthermore, we provide a protocol that allows the committer to prolong the bindingness property of a given commitment while showing in zero-knowledge fashion that the value committed to did not change. In addition, our construction yields two more interesting features: one is the ability to "convert" a Pedersen commitment into a lattice-based one, and the other one is the construction of a hybrid approach whose bindingness relies on the discrete logarithm and approximate shortest vector problems.
Webseite eprint.iacr.org/2015/628
[Diesen Eintrag nach BibTeX exportieren]

Important Copyright Notice:

The documents contained in these directories are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
A A A | Drucken Drucken | Impressum Impressum | Sitemap Sitemap | Suche Suche | Kontakt Kontakt | Webseitenanalyse: Mehr Informationen
zum Seitenanfangzum Seitenanfang