Show simple item record

dc.contributor.author
Maurer, Ueli
dc.date.accessioned
2020-09-29T13:17:51Z
dc.date.available
2017-06-11T00:44:02Z
dc.date.available
2020-09-29T13:17:51Z
dc.date.issued
2013
dc.identifier.isbn
978-1-4799-0446-4
en_US
dc.identifier.other
10.1109/ISIT.2013.6620719
en_US
dc.identifier.uri
http://hdl.handle.net/20.500.11850/75434
dc.description.abstract
Information-theoretic message authentication is traditionally defined as the task of authenticating a message, transmitted over an insecure channel, using a secret key shared between sender and receiver. Previous results have investigated the trade-offs between key size, message size, and the adversary's cheating probability. In this paper we propose a new approach to information-theoretic authentication, without a secret key, but assuming that a short message (much shorter than the actual message) can be transmitted authentically, for example by speaker identification over the phone. By using such a scheme recursively one can authenticate arbitrarily long messages if one can authenticate a very short message whose length only depends on the desired cheating probability, and if it is guaranteed as a mild form of synchronization that every message arrives before the next one is sent. This result has also implications for key-based authentication. If the short message is itself authenticated with a key-based scheme, this combined scheme yields an optimal key-based authentication scheme for arbitrarily long messages, provably beating the best traditional authentication code, i.e., the best scheme that transmits a single key-dependent message over an insecure channel. The required key size is independent of the message length, which is impossible to achieve for traditional authentication codes. The proposed schemes are not only of theoretical interest but may well have practical applications in contexts where information-theoretic security is required, for example in quantum cryptography.
en_US
dc.language.iso
en
en_US
dc.publisher
IEEE
en_US
dc.title
Authentication Amplification by Synchronization
en_US
dc.type
Conference Paper
dc.date.published
2013-10-08
ethz.book.title
2013 IEEE International Symposium on Information Theory
en_US
ethz.pages.start
2711
en_US
ethz.pages.end
2714
en_US
ethz.event
2013 IEEE International Symposium on Information Theory (ISIT 2013)
en_US
ethz.event.location
Istanbul, Turkey
en_US
ethz.event.date
July 7-12, 2013
en_US
ethz.identifier.scopus
ethz.publication.place
Piscataway, NJ
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
ethz.date.deposited
2017-06-11T00:44:11Z
ethz.source
ECIT
ethz.identifier.importid
imp593651423a14e71163
ethz.ecitpid
pub:119072
ethz.eth
yes
en_US
ethz.availability
Metadata only
en_US
ethz.rosetta.installDate
2017-07-17T08:31:09Z
ethz.rosetta.lastUpdated
2018-11-02T11:38:53Z
ethz.rosetta.exportRequired
true
ethz.rosetta.versionExported
true
ethz.COinS
ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.atitle=Authentication%20Amplification%20by%20Synchronization&rft.date=2013&rft.spage=2711&rft.epage=2714&rft.au=Maurer,%20Ueli&rft.isbn=978-1-4799-0446-4&rft.genre=proceeding&rft_id=info:doi/978-1-4799-0446-4&rft.btitle=2013%20IEEE%20International%20Symposium%20on%20Information%20Theory
 Search via SFX

Files in this item

FilesSizeFormatOpen in viewer

There are no files associated with this item.

Publication type

Show simple item record