NDLI: On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols

Please wait, while we are loading the content...

On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols

Content Provider	Springer Nature Link
Author	Rührmair, Ulrich Dijk, Marten
Copyright Year	2013
Abstract	In recent years, PUF-based schemes have been suggested not only for the basic tasks of tamper-sensitive key storage or the identification of hardware systems, but also for more complex protocols like oblivious transfer (OT) or bit commitment (BC), both of which possess broad and diverse applications. In this paper, we continue this line of research. We first present an attack on two recent OT and BC protocols which have been introduced by Brzuska et al. (CRYPTO, LNCS 6841, pp 51–70, Springer 2011). The attack quadratically reduces the number of CRPs which malicious players must read out to cheat, and fully operates within the original communication model of Brzuska et al. (CRYPTO, LNCS 6841, pp 51–70, Springer 2011). In practice, this leads to insecure protocols when electrical PUFs with a medium challenge-length are used (e.g., 64 bits), or whenever optical PUFs are employed. These two PUF types are currently among the most popular designs of so-called Strong PUFs. Secondly, we show that the same attack applies to a recent OT protocol of Ostrovsky et al. (IACR Cryptol. ePrint Arch. 2012:143, 2012), leading to exactly the same consequences. Finally, we discuss countermeasures. We present a new OT protocol with better security properties, which utilizes interactive hashing as a substep and is based on an earlier protocol by Rührmair (TRUST, LNCS 6101, pp 430–440, Springer 2010). We then closely analyze its properties, including its security, security amplification, and practicality.
Starting Page	17
Ending Page	28
Page Count	12
File Format	PDF
ISSN	21908508
Journal	Journal of Cryptographic Engineering
Volume Number	3
Issue Number	1
e-ISSN	21908516
Language	English
Publisher	Springer-Verlag
Publisher Date	2013-03-26
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Physical unclonable functions (PUFs) Cryptographic protocols Oblivious transfer Bit commitment Security analysis Interactive hashing Data Encryption Circuits and Systems Computer Communication Networks Communications Engineering, Networks Data Structures, Cryptology and Information Theory Operating Systems
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Recyclable PUFs: logically reconfigurable PUFs

A practical device authentication scheme using SRAM PUFs

Analysis and experimental evaluation of image-based PUFs

Having no mathematical model may not secure PUFs

Faster 64-bit universal hashing using carry-less multiplications

Secure key generation from biased PUFs: extended version

Introduction to the Journal of Cryptographic Engineering

Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions

PAC learning of arbiter PUFs

On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols

Similar Documents

Recyclable PUFs: logically reconfigurable PUFs

A practical device authentication scheme using SRAM PUFs

Analysis and experimental evaluation of image-based PUFs

Having no mathematical model may not secure PUFs

Faster 64-bit universal hashing using carry-less multiplications

Secure key generation from biased PUFs: extended version

Introduction to the Journal of Cryptographic Engineering

Efficient implementation of generalized Maiorana–McFarland class of cryptographic functions

PAC learning of arbiter PUFs

On the practical use of physical unclonable functions in oblivious transfer and bit commitment protocols