@prefix ns1: .
@prefix ns2: .
@prefix rdf: .
@prefix rdfs: .
@prefix xml: .
@prefix xsd: .
a ns1:Chapter ;
ns1:about ,
;
ns1:author ( ) ;
ns1:datePublished "2006" ;
ns1:datePublishedReg "2006-01-01" ;
ns1:description "We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and by a low-bandwidth auxiliary channel, that enables the sender to “manually” authenticate one short message to the receiver (for example, by typing a short string or comparing two short strings). We consider this model in a setting where no computational assumptions are made, and prove that for any 0 < ε< 1 there exists a log*n-round protocol for authenticating n-bit messages, in which only 2 log(1 /ε) + O(1) bits are manually authenticated, and any adversary (even computationally unbounded) has probability of at most ε to cheat the receiver into accepting a fraudulent message. Moreover, we develop a proof technique showing that our protocol is essentially optimal by providing a lower bound of 2 log(1/ ε) – 6 on the required length of the manually authenticated string.The second model we consider is the traditional message authentication model. In this model the sender and the receiver share a short secret key; however, they are connected only by an insecure channel. Once again, we apply our proof technique, and prove a lower bound of 2 log(1/ ε) – 2 on the required Shannon entropy of the shared key. This settles an open question posed by Gemmell and Naor (CRYPTO ’93).Finally, we prove that one-way functions are essential (and sufficient) for the existence of protocols breaking the above lower bounds in the computational setting." ;
ns1:editor ( [ a ns1:Person ;
ns1:familyName "Dwork" ;
ns1:givenName "Cynthia" ] ) ;
ns1:genre "chapter" ;
ns1:inLanguage "en" ;
ns1:isAccessibleForFree true ;
ns1:isPartOf [ a ns1:Book ;
ns1:isbn "978-3-540-37432-9",
"978-3-540-37433-6" ;
ns1:name "Advances in Cryptology - CRYPTO 2006" ] ;
ns1:keywords "Gemmell",
"Naor",
"Shannon entropy",
"above lower bounds",
"adversary",
"assumption",
"authentication model",
"authentication problem",
"authentication protocol",
"auxiliary channel",
"bits",
"bounds",
"channels",
"communication model",
"computational assumptions",
"computational setting",
"different communication models",
"entropy",
"existence",
"existence of protocols",
"first model",
"fraudulent messages",
"function",
"insecure channel",
"key",
"key model",
"length",
"lower bounds",
"manual channel",
"messages",
"model",
"n-bit message",
"one-way functions",
"open question",
"probability",
"problem",
"proof technique",
"protocol",
"questions",
"receiver",
"round protocol",
"second model",
"secret key",
"sender",
"setting",
"short messages",
"short secret key",
"string",
"technique",
"tight bounds" ;
ns1:name "Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models" ;
ns1:pagination "214-231" ;
ns1:productId [ a ns1:PropertyValue ;
ns1:name "doi" ;
ns1:value "10.1007/11818175_13" ],
[ a ns1:PropertyValue ;
ns1:name "dimensions_id" ;
ns1:value "pub.1040061033" ] ;
ns1:publisher [ a ns1:Organisation ;
ns1:name "Springer Nature" ] ;
ns1:sameAs ,
;
ns1:sdDatePublished "2022-05-20T07:44" ;
ns1:sdLicense "https://scigraph.springernature.com/explorer/license/" ;
ns1:sdPublisher [ a ns1:Organization ;
ns1:name "Springer Nature - SN SciGraph project" ] ;
ns1:url "https://doi.org/10.1007/11818175_13" ;
ns2:license ;
ns2:sdDataset "chapters" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Information and Computing Sciences" .
a ns1:DefinedTerm ;
ns1:inDefinedTermSet ;
ns1:name "Data Format" .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Smith" ;
ns1:givenName "Adam" ;
ns1:sameAs .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Segev" ;
ns1:givenName "Gil" ;
ns1:sameAs .
a ns1:Person ;
ns1:affiliation ;
ns1:familyName "Naor" ;
ns1:givenName "Moni" ;
ns1:sameAs .
a ns1:Organization ;
ns1:alternateName "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, 76100, Rehovot, Israel" ;
ns1:name "Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, 76100, Rehovot, Israel" .