메뉴 건너뛰기




Volumn 11, Issue 3, 2012, Pages 76-83

Toward more secure and reliable access control

Author keywords

access control; distance bounding protocols; RFID; threshold cryptography

Indexed keywords

ACCESS CONTROL MECHANISM; DISTANCE BOUNDING; PERSONAL DEVICES; PRIVATE KEY; RELAY ATTACK; REMOTE USERS; SECURITY TOKENS; SINGLE POINT; SYSTEM SECURITY; THRESHOLD CRYPTOGRAPHY;

EID: 84863535705     PISSN: 15361268     EISSN: None     Source Type: Journal    
DOI: 10.1109/MPRV.2011.42     Document Type: Article
Times cited : (10)

References (21)
  • 1
    • 84976295016 scopus 로고
    • Distance-bounding protocols
    • LNCS 765, Springer
    • S. Brands and D. Chaum, "Distance-Bounding Protocols," Advances in Cryptology-Eurocrypt 93, LNCS 765, Springer, 1994, pp. 344-359.
    • (1994) Advances in Cryptology-Eurocrypt , vol.93 , pp. 344-359
    • Brands, S.1    Chaum, D.2
  • 3
    • 70349451691 scopus 로고    scopus 로고
    • Confidence in smart token proximity: Relay attacks revisited
    • G. Hancke, K. Mayes, and K. Markantonakis, "Confidence in Smart Token Proximity: Relay Attacks Revisited," Elsevier Computers and Security, vol. 28, no. 7, 2009, pp. 615-627.
    • (2009) Elsevier Computers and Security , vol.28 , Issue.7 , pp. 615-627
    • Hancke, G.1    Mayes, K.2    Markantonakis, K.3
  • 4
    • 76549089483 scopus 로고    scopus 로고
    • Threshold things that think (t4): Security requirements to cope with theft of handheld/handless internet devices
    • Y. Desmedt et al., "Threshold Things That Think (T4): Security Requirements to Cope with Theft of Handheld/Handless Internet Devices," Proc. Symp. Requirements Engineering for Information Security, 2001; web.science.mq.edu. au/hwang/t4.ps.
    • (2001) Proc. Symp. Requirements Engineering for Information Security
    • Desmedt, Y.1
  • 7
    • 35048891868 scopus 로고    scopus 로고
    • Keying hash functions for message authentication
    • Advances in Cryptology - CRYPTO '96
    • M. Bellare, R. Canetti, and H. Krawczyk, "Keying Hash Functions for Message Authentication," Advances in Cryptology-Crypto 96, LNCS 1109, Springer, 1996, pp. 1-15. (Pubitemid 126106226)
    • (1996) Lecture Notes in Computer Science , Issue.1109 , pp. 1-15
    • Bellare, M.1    Canetti, R.2    Krawczyk, H.3
  • 8
    • 70350424442 scopus 로고    scopus 로고
    • An efficient distance bounding rfid authentication protocol: Balancing false-Acceptance rate and memory requirement
    • LNCS 5735, Springer
    • G. Avoine and A. Tchamkerten, "An Efficient Distance Bounding RFID Authentication Protocol: Balancing False-Acceptance Rate and Memory Requirement," Proc. 12th Int'l Conf. Information Security (ISC 09), LNCS 5735, Springer, 2009, pp. 250-261.
    • (2009) Proc. 12th Int'l Conf. Information Security (ISC 09) , pp. 250-261
    • Avoine, G.1    Tchamkerten, A.2
  • 10
    • 79952438809 scopus 로고    scopus 로고
    • Design of a secure distance-bounding channel for rfid
    • G. Hancke, "Design of a Secure Distance-Bounding Channel for RFID," J. Network and Computer Applications, vol. 34, no. 3, 2011, pp. 877-887.
    • (2011) J. Network and Computer Applications , vol.34 , Issue.3 , pp. 877-887
    • Hancke, G.1
  • 14
    • 0018545449 scopus 로고
    • How to share a secret
    • A. Shamir, "How to Share a Secret," Comm. ACM, vol. 22, no. 11, 1979, pp. 612-613.
    • (1979) Comm. ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1
  • 15
    • 38049015807 scopus 로고    scopus 로고
    • Fpga intrinsic pufs and their use for ip protection
    • LNCS 4727, Springer
    • J. Guajardo et al., "FPGA Intrinsic PUFs and Their Use for IP Protection," Cryptographic Hardware and Embedded Systems Workshop, LNCS 4727, Springer, 2007, pp. 63-80.
    • (2007) Cryptographic Hardware and Embedded Systems Workshop , pp. 63-80
    • Guajardo, J.1
  • 17
    • 78650257983 scopus 로고    scopus 로고
    • Increased resilience in threshold cryptography: Sharing a secret with devices that cannot store shares
    • LNCS 6487
    • K. Simoens, R. Peeters, and B. Preneel, "Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares," Pairing-Based Cryptography-Pairing 2010, LNCS 6487, 2010, pp. 116-135.
    • (2010) Pairing-Based Cryptography-Pairing , vol.2010 , pp. 116-135
    • Simoens, K.1    Peeters, R.2    Preneel, B.3
  • 18
    • 0018048246 scopus 로고
    • Using encryption for authentication in large networks of computers
    • R. Needham and M. Schroeder, "Using Encryption for Authentication in Large Networks of Computers," Comm. ACM, vol. 21, no. 12, 1978, pp. 393-399.
    • (1978) Comm. ACM , vol.21 , Issue.12 , pp. 393-399
    • Needham, R.1    Schroeder, M.2
  • 19
    • 85032883059 scopus 로고
    • A public key cryptosystem and a signature scheme based on discrete logarithms
    • LNCS 196, G.R. Blakley and D. Chaum, eds., Springer
    • T.E. Gamal, "A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms," Advances in Cryptology-Crypto 84, LNCS 196, G.R. Blakley and D. Chaum, eds., Springer, 1985, pp. 10-18.
    • (1985) Advances in Cryptology-Crypto , vol.84 , pp. 10-18
    • Gamal, T.E.1
  • 20
    • 77952337733 scopus 로고    scopus 로고
    • Low-cost untraceable authentication protocols for rfid
    • C. Nita-Rotaru and F. Stajano, eds., ACM
    • Y.K. Lee et al., "Low-Cost Untraceable Authentication Protocols for RFID," Proc. 3rd ACM Conf. Wireless Network Security (WiSec 10), C. Nita-Rotaru and F. Stajano, eds., ACM, 2010, pp. 54-64.
    • (2010) Proc. 3rd ACM Conf. Wireless Network Security (WiSec 10) , pp. 54-64
    • Lee, Y.K.1
  • 21
    • 38549135553 scopus 로고    scopus 로고
    • Efficient implementation of the pairing on mobilephones using brew
    • LNCS 4867, S. Kim, M. Yung, and H.-W. Lee, eds., Springer
    • M. Yoshitomi et al., "Efficient Implementation of the Pairing on Mobilephones Using BREW," Information Security Applications, LNCS 4867, S. Kim, M. Yung, and H.-W. Lee, eds., Springer, 2007, pp. 203-214.
    • (2007) Information Security Applications , pp. 203-214
    • Yoshitomi, M.1


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