메뉴 건너뛰기




Volumn , Issue , 2012, Pages 478-485

Expected loss bounds for authentication in constrained channels

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION PROTOCOLS; COMMUNICATION COST; CONSTRAINED CHANNELS; DERIVE BOUNDS; EXPECTED LOSS; IN-CHANNELS; LOWER BOUNDS; OPTIMAL VALUES; SIMPLE METHOD; UPPER BOUND;

EID: 84861639928     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195788     Document Type: Conference Paper
Times cited : (11)

References (23)
  • 3
    • 84976295016 scopus 로고
    • Distance-bounding protocols
    • Proc. EUROCRYPT'93, ser.
    • S. Brands and D. Chaum, "Distance-bounding protocols," in Proc. EUROCRYPT'93, ser. LNCS, vol. 765, 1994, pp. 344-359.
    • (1994) LNCS , vol.765 , pp. 344-359
    • Brands, S.1    Chaum, D.2
  • 4
    • 84885078444 scopus 로고    scopus 로고
    • Distance-bounding proof of knowledge to avoid real-time attacks
    • Springer Boston
    • L. Bussard and W. Bagga, "Distance-bounding proof of knowledge to avoid real-time attacks," in Security and Privacy in the Age of Ubiquitous Computing, vol. 181. Springer Boston, 2005, pp. 223-238.
    • (2005) Security and Privacy in the Age of Ubiquitous Computing , vol.181 , pp. 223-238
    • Bussard, L.1    Bagga, W.2
  • 5
    • 38149028509 scopus 로고    scopus 로고
    • Distance bounding in noisy environments
    • Security and Privacy in Ad-hoc and Sensor Networks - ESAS 2007, ser. Springer
    • D. Singelée and B. Preneel, "Distance bounding in noisy environments,"in Security and Privacy in Ad-hoc and Sensor Networks - ESAS 2007, ser. LNCS, vol. 4572. Springer, 2007, pp. 101-115.
    • (2007) LNCS , vol.4572 , pp. 101-115
    • Singelée, D.1    Preneel, B.2
  • 6
    • 70350366909 scopus 로고    scopus 로고
    • ID-Based Secure Distance Bounding and Localization
    • Computer Security - ESORICS 2009, ser. Springer Berlin / Heidelberg
    • N. O. Tippenhauer and S. Čapkun, "ID-Based Secure Distance Bounding and Localization," in Computer Security - ESORICS 2009, ser. LNCS, vol. 5789. Springer Berlin / Heidelberg, 2010, pp. 621-636.
    • (2010) LNCS , vol.5789 , pp. 621-636
    • Tippenhauer, N.O.1    Čapkun, S.2
  • 8
    • 76749095501 scopus 로고    scopus 로고
    • RFID distance bounding protocol with mixed challenges to prevent relay attacks
    • ePrint Archive, Report 2009/310
    • C. Kim and G. Avoine. (2009) RFID distance bounding protocol with mixed challenges to prevent relay attacks. Cryptology ePrint Archive, Report 2009/310.
    • (2009) Cryptology
    • Kim, C.1    Avoine, G.2
  • 10
    • 34748825630 scopus 로고    scopus 로고
    • Detecting relay attacks with timing-based protocols
    • ACM
    • J. Reid, J. M. G. Nieto, T. Tang, and B. Senadji, "Detecting relay attacks with timing-based protocols," in Proc. ASIACCS'07. ACM, 2007, pp. 204-213.
    • (2007) Proc. ASIACCS'07 , pp. 204-213
    • Reid, J.1    Nieto, J.M.G.2    Tang, T.3    Senadji, B.4
  • 11
    • 70349940333 scopus 로고    scopus 로고
    • The Swiss-knife RFID distance bounding protocol
    • Proceedings of ICISC '08, ser. Springer-Verlag, Dec.
    • C. Kim, G. Avoine, F. Koeune, F. X. Standaert, and O. Pereira, "The Swiss-knife RFID distance bounding protocol," in Proceedings of ICISC '08, ser. LNCS. Springer-Verlag, Dec. 2008.
    • (2008) LNCS
    • Kim, C.1    Avoine, G.2    Koeune, F.3    Standaert, F.X.4    Pereira, O.5
  • 13
    • 0013398251 scopus 로고    scopus 로고
    • Major security problems with the "unforgeable" (Feige)-Fiat-Shamir proofs of identity and how to overcome them
    • Y. Desmedt, "Major security problems with the " unforgeable" (Feige)-Fiat-Shamir proofs of identity and how to overcome them," in Proc. SecuriCom '88, Mar. 1988, pp. 147-159.
    • Proc. SecuriCom '88, Mar. 1988 , pp. 147-159
    • Desmedt, Y.1
  • 14
    • 84936749991 scopus 로고    scopus 로고
    • Distinguishing distributions using Chernoff information
    • Springer-Verlag
    • T. Baignères, P. Sepehrdad, and S. Vaudenay, "Distinguishing distributions using Chernoff information," in ProvSec 2010. Springer-Verlag, 2010.
    • (2010) ProvSec 2010
    • Baigneres, T.1    Sepehrdad, P.2    Vaudenay, S.3
  • 16
    • 0001549344 scopus 로고
    • Sequential design of experiments
    • H. Chernoff, "Sequential design of experiments," Annals of Mathematical Statistics, vol. 30, no. 3, pp. 755-770, 1959.
    • (1959) Annals of Mathematical Statistics , vol.30 , Issue.3 , pp. 755-770
    • Chernoff, H.1
  • 17
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • -, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Annals of Mathematical Statistics, vol. 23, no. 4, pp. 493-507, 1952.
    • (1952) Annals of Mathematical Statistics , vol.23 , Issue.4 , pp. 493-507
    • Chernoff, H.1
  • 18
    • 0031334110 scopus 로고    scopus 로고
    • Does parallel repetition lower the error in computationally sound protocols?
    • Published by the IEEE Computer Society
    • M. Bellare, R. Impagliazzo, and M. Naor, "Does parallel repetition lower the error in computationally sound protocols?" in focs. Published by the IEEE Computer Society, 1997, p. 374.
    • (1997) Focs , pp. 374
    • Bellare, M.1    Impagliazzo, R.2    Naor, M.3
  • 19
    • 4544259841 scopus 로고    scopus 로고
    • Sector: Secure tracking of node encounters in multi-hop wireless networks
    • October
    • S. Čapkun, L. Buttyán, and J. Hubaux, "Sector: Secure tracking of node encounters in multi-hop wireless networks," in ACM SASN, October 2003, pp. 21-32.
    • (2003) ACM SASN , pp. 21-32
    • Čapkun, S.1    Buttyán, L.2    Hubaux, J.3
  • 23
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • March
    • W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, vol. 58, no. 301, pp. 13-30, March 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.