Show simple item record

dc.contributor.author
Badertscher, Christian
dc.contributor.author
Jost, Daniel
dc.contributor.author
Maurer, Ueli
dc.contributor.editor
Nissim, Kobbi
dc.contributor.editor
Waters, Brent
dc.date.accessioned
2021-12-01T11:03:37Z
dc.date.available
2021-11-30T14:12:57Z
dc.date.available
2021-12-01T10:58:13Z
dc.date.available
2021-12-01T11:03:37Z
dc.date.issued
2021
dc.identifier.isbn
978-3-030-90458-6
en_US
dc.identifier.isbn
978-3-030-90459-3
en_US
dc.identifier.issn
0302-9743
dc.identifier.issn
1611-3349
dc.identifier.other
10.1007/978-3-030-90459-3_17
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/517830
dc.description.abstract
Proofs of knowledge (PoK) are one of the most fundamental notions in cryptography. The appeal of this notion is that it provides a general template that an application can suitably instantiate by choosing a specific relation. Nonetheless, several important applications have been brought to light, including proofs-of-ownership of files or two-factor authentication, which do not fit the PoK template but naturally appear to be special cases of a more general notion of proofs of knowledge or possession. One would thus expect that their security properties, in particular privacy and soundness, are simply derived as concrete instantiation of a common generalized PoK concept with well understood security semantics. Unfortunately, such a notion does not exist, resulting in a variety of tailor-made security definitions whose plausibility must be checked on a case-by-case basis. In this work, we close this gap by providing the theoretical foundations of a generalized notion of PoK that encompasses dynamic and setup-dependent relations as well as interactive statement derivations. This novel combination enables an application to directly specify relations that depend on an assumed setup, such as a random oracle, a database or ledger, and to have statements be agreed upon interactively and dynamically between parties based on the state of the setup. Our new notion is called agree-and-prove and provides clear semantics of correctness, soundness, and zero-knowledge in the above generalized scenario. As an application, we first consider proofs-of-ownership of files for client-side file deduplication. We cast the problem and some of its prominent schemes in our agree-and-prove framework and formally analyze their security. Leveraging our generic zero-knowledge formalization, we then devise a novel scheme that is provably the privacy-preserving analogue of the well-known Merkle-Tree based protocol. As a second application, we consider two-factor entity authentication to showcase how the agree-and-prove notion encompasses proofs of ability, such as proving the correct usage of an abstract hardware token.
en_US
dc.language.iso
en
en_US
dc.publisher
Springer
en_US
dc.title
Generalized Proofs of Knowledge with Fully Dynamic Setup
en_US
dc.type
Conference Paper
dc.date.published
2021-11-04
ethz.book.title
Theory of Cryptography
en_US
ethz.journal.title
Lecture Notes in Computer Science
ethz.journal.volume
13042
en_US
ethz.journal.abbreviated
LNCS
ethz.pages.start
499
en_US
ethz.pages.end
528
en_US
ethz.event
19th International Conference on Theory of Cryptography Conference (TCC 2021)
en_US
ethz.event.location
Raleigh, NC, USA
en_US
ethz.event.date
November 8-11, 2021
en_US
ethz.identifier.wos
ethz.publication.place
Cham
en_US
ethz.publication.status
published
en_US
ethz.leitzahl
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03338 - Maurer, Ueli / Maurer, Ueli
en_US
ethz.leitzahl.certified
ETH Zürich::00002 - ETH Zürich::00012 - Lehre und Forschung::00007 - Departemente::02150 - Dep. Informatik / Dep. of Computer Science::02643 - Institut für Theoretische Informatik / Inst. Theoretical Computer Science::03338 - Maurer, Ueli / Maurer, Ueli
en_US
ethz.date.deposited
2021-11-30T14:13:02Z
ethz.source
FORM
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2021-12-01T10:58:21Z
ethz.rosetta.lastUpdated
2022-03-29T16:21:18Z
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Generalized%20Proofs%20of%20Knowledge%20with%20Fully%20Dynamic%20Setup&rft.jtitle=Lecture%20Notes%20in%20Computer%20Science&rft.date=2021&rft.volume=13042&rft.spage=499&rft.epage=528&rft.issn=0302-9743&1611-3349&rft.au=Badertscher,%20Christian&Jost,%20Daniel&Maurer,%20Ueli&rft.isbn=978-3-030-90458-6&978-3-030-90459-3&rft.genre=proceeding&rft_id=info:doi/10.1007/978-3-030-90459-3_17&rft.btitle=Theory%20of%20Cryptography
 Search print copy at ETH Library

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record