Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs.
Saikrishna Badrinarayanan, Dakshita Khurana, Rafail Ostrovsky, Ivan Visconti
Abstract:
Brzuska et. al.(Crypto 2011) proved that unconditional UC-secure computation is possible if parties have access to honestly generated physically unclonable functions ( PUFs). Daachman-Soled et. al. ( Crypto 2014) then showed how to obtain unconditional UC secure Computation based on malicious PUfs, assuming such PUFs are stateless. They also showed that unconditional oblivious transfer is impossible against an adversary that creates malicious stateful PUFs.
In this work we go beyond this seemingly tight result, by allowing any adversary to create statful PUFs with a-priori bounded state. This relaxes the restriction on the power of the adversary (limited to stateless PUFs in previous feasibility results), therefore achieving improved security guarantees. This is also motivated by practical scenarios, where the size of a physical object may be used to compute an upper bound on the size of its memory.
As second contribution, we introduce a new model where any adversary is allowed to generate a malicious PUF that many encapsulate other (honestly generated) PUFs within it, such that the outer PUF has oracle access to all the inner PUFs. This is again a natural scenario, and in fact, similar adversaries have been studied in the tamper-proof hardware-token model )e.g., Chandran et. al. ( Eurocrypt 2008)) , but no such notion has ever been considered with respect to PUFs.All previous constructions of UC secure protocols suffer from explicit attacks in this stronger model.
In a direct improvement over previous results, we construst UC protocols with unconditional security in both these models.
comment: EUROCRYPT (1) 2017: 382-411
Fetch PDF file of the paper
| Back to Publications List |