See this document in CiteSeerX!

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models (2006)  (Make Corrections)  (2 citations)
Moni Naor, Gil Segev, Adam Smith



  Home/Search   Context   Related

 
View or download:
iacr.org/2006/175.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iacr.org/2006/ (more)
Homepages:  G.Segev  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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 < \epsilon < 1$ ... (Update)

Cited by:   More
Noninteractive Two-Channel Message Authentication Based on.. - Mashatan, Stinson (2006)   (Correct)
Tight Bounds for Unconditional Authentication Protocols in.. - Naor, Segev, Smith (2006)   (Correct)

Active bibliography (related documents):   More   All
1.1:   Loud and Clear: Human-Verifiable Authentication Based.. - Goodrich, Sirivianos, .. (2005)   (Correct)
0.9:   Towards an Open Source Toolkit for Ubiquitous Device.. - Rene Mayrhofer Lancaster   (Correct)
0.8:   Authentication Theory and Hypothesis Testing - Maurer   (Correct)

Similar documents based on text:
6.0:   Unknown -   (Correct)

Related documents from co-citation:   More   All
2:   Manual authentication for wireless devices (context) - Gehrmann, Mitchell et al. - 2004
2:   An optimal non-interactive message authentication protocol (context) - Pasini, Vaudenay - 2006
2:   Secure communications over insecure channels based on short authenticated string.. (context) - Vaudenay - 2005

BibTeX entry:   (Update)

M. Naor, G. Segev, and A. Smith. Tight bounds for unconditional authentication protocols in the manual channel and shared key models. In Advances in Cryptology - CRYPTO '06, pages 214--231, 2006. http://citeseer.ist.psu.edu/naor06tight.html   More

@misc{ naor06tight,
  author = "M. Naor and G. Segev and A. Smith",
  title = "Tight bounds for unconditional authentication protocols in the manual channel
    and shared key models",
  text = "M. Naor, G. Segev, and A. Smith. Tight bounds for unconditional authentication
    protocols in the manual channel and shared key models. In Advances in Cryptology
    - CRYPTO '06, pages 214--231, 2006.",
  year = "2006",
  url = "citeseer.ist.psu.edu/naor06tight.html" }
Citations (may not include all citations):
1023   RTP: A Transport Protocol for Real-Time Applications - Schulzrinne, Casner et al. - 2003
326   Non-malleable cryptography - Dolev, Dwork et al. - 2000
191   New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
79   One-way functions are essential for complexity based cryptog.. (context) - Impagliazzo, Luby - 1989
40   Codes which detect deception (context) - Gilbert, MacWilliams et al. - 1974
35   New algorithms for finding irreducible polynomials over fini.. - Shoup - 1990
21   Non-interactive and non-malleable commitment - Di Crescenzo, Ishai et al. - 1998
21   How to expose an eavesdropper (context) - Rivest, Shamir - 1984
19   Constant-round coin-tossing with a man in the middle or real.. - Barak - 2002
18   Some constructions and bounds for authentication codes (context) - Stinson - 1988
13   Authentication theorycoding theory (context) - theory, In et al. - 1984
13   Codes for interactive authentication - Gemmell, Naor - 1993
10   cient and non-interactive non-malleable commitment (context) - Di Crescenzo, Katz et al. - 2001
5   Seeing-Is-Believing: Using camera phones for humanverifiable.. (context) - McCune, Perrig et al. - 2005
5   Manual authentication for wireless devices (context) - Gehrmann, Mitchell et al. - 2004
4   IEEE Transactions on Information Theory (context) - Maurer, hypothesis - 2000
4   Secure communications over insecure channels based on short .. (context) - Vaudenay - 2005
4   Strengthening Simmons' bound on impersonation (context) - Johannesson, Sgarro - 1991
3   Loud and Clear: Human-verifiable authentication based on aud.. - Goodrich, Sirivianos et al. - 2005
3   New and improved constructions of non-malleable cryptographi.. (context) - Pass, Rosen - 2005
2   The ephemeral pairing problem - Hoepman - 2004
2   An optimal non-interactive message authentication protocol (context) - Pasini, Vaudenay - 2006
2   Ephemeral pairing on anonymous networks - Hoepman - 2005
2   Information-theoretic bounds for authentication frauds (context) - Sgarro - 1993
2   Key agreement in peer-to-peer wireless networks (context) - Cagalj, Capkun et al. - 2006
2   Tight bounds for unconditional authentication protocols in t.. - Naor, Segev et al. - 2006
1   The practice of authentication (context) - Simmons - 1985
1   Cryptanalysis of the Gemmell and Naor multiround authenticat.. - Gehrmann - 1994
1   cient mutual data authentication using manually authenticate.. (context) - Laur, Asokan et al. - 2005
1   The complexity of online memory checking - Naor, Rothblum - 2005
1   Informational divergence bounds for authentication codes (context) - Sgarro - 1989
1   Digital signature schemes with domain parameters: Yet anothe.. (context) - Vaudenay - 2004
1   Multiround unconditionally secure authentication (context) - Gehrmann - 1998
http://www.bluetooth.com/bluetooth/
http://www.usb.org/developers/wusb/

Documents on the same site (http://eprint.iacr.org/2006/):   More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006)   (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006)   (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC