Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cryptographic Engineering

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

Ulrich Rührmair, Marten van Dijk

Published Mar 25, 2013• 33 citations
Publisher
DOI
10.1007/s13389-013-0052-8

Related papers

Oblivious Transfer Based on Physical Unclonable Functions

Ulrich Rührmair

Lecture notes in computer science•Jan 1, 2010•70 citations

On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions

Ivan Damgård, Joe Kilian, Louis Salvail

Lecture notes in computer science•Jan 1, 1999•143 citations

Efficient Committed Oblivious Transfer of Bit Strings

Mehmet Sabır Kiraz, Berry Schoenmakers, José Villegas

Lecture notes in computer science•Jan 1, 2007•16 citations

The Physics of No-Bit-Commitment: Generalized Quantum Non-Locality Versus Oblivious Transfer

Anthony J. Short, Nicolas Gisin, Sandu Popescu

Quantum Information Processing•Apr 1, 2006•22 citations

Quantum Bit Commitment Based on Qubit Oblivious Transfer

Yang Yang, Wei Wei, Huang +5 more

Chinese Journal of Electronics•Jan 1, 2009•0 citations

Commitments via Physically Related Functions

Harishma Boyapally, Sikhar Patranabis, Debdeep Mukhopadhyay

Commitment schemes are one of the basic building blocks to construct secure protocols for multi party computation. Many recent works are exploring hardware primitives like physically unclonable functions to build keyless cryptographic protocols, with minimal assumptions. The asymmetric nature and non-invertibility property of PUFs are widely exploited to build oblivious transfer protocols that are extended to build bit-commitment schemes. However, these schemes require the physical transfer of the PUF device between the interacting parties. In this work, we introduce a new class of hardware-based primitives called physically related functions that enable hardware circuits to securely communicate with each other over insecure channels. We propose a bit-commitment protocol based on this hardware primitive without needing any physical transfer. Our scheme is statistically hiding and computationally binding, requiring only one round of communication while being practically deployable. We explore the security properties of physically related functions, under which we prove the security of our scheme. We experimentally show that it is impossible to break the security of the scheme with more than negligible probability.

IEEE Transactions on Information Forensics and Security•Jan 1, 2023•4 citations
Commitment schemes are one of the basic building blocks to construct secure protocols for multi party computation. Many recent works are exploring hardware primitives like physically unclonable functions to build keyless cryptographic protocols, with minimal assumptions. The asymmetric nature and non-invertibility property of PUFs are widely exploited to build oblivious transfer protocols that are extended to build bit-commitment schemes. However, these schemes require the physical transfer of the PUF device between the interacting parties. In this work, we introduce a new class of hardware-based primitives called physically related functions that enable hardware circuits to securely communicate with each other over insecure channels. We propose a bit-commitment protocol based on this hardware primitive without needing any physical transfer. Our scheme is statistically hiding and computationally binding, requiring only one round of communication while being practically deployable. We explore the security properties of physically related functions, under which we prove the security of our scheme. We experimentally show that it is impossible to break the security of the scheme with more than negligible probability.