Back to Results
First PageMeta Content
Models of computation / Oblivious transfer / Random oracle / Oracle machine / FO / Query / IP / Advantage / Cryptography / Theoretical computer science / Computability theory


Feasibility and Infeasibility of Secure Computation with Malicious PUFs Dana Dachman-Soled1 , Nils Fleischhacker2 , Jonathan Katz1 , Anna Lysyanskaya3 , and Dominique Schr¨oder2 1
Add to Reading List

Document Date: 2015-04-29 09:12:17


Open Document

File Size: 361,85 KB

Share Result on Facebook

Company

Other Related Work Hardware / PUFj / /

/

Event

FDA Phase / /

Facility

Brown University / Saarland University / /

IndustryTerm

uncontrollable manufacturing variations / oblivious-transfer protocol / composable protocols / physical technology / evaluation algorithm / cryptographic applications / honest algorithm / physical device / polynomial-time algorithm / heavy machinery / /

Organization

Saarland University / University of Maryland / Brown University / /

Person

Dominique Schr / /

Product

PUFs / PUF0R / PUF0S / /

Technology

Eve algorithm / round OT protocol / PUF-based OT-protocol / OT protocol / evaluation algorithm / polynomial-time algorithm / physical technology / previous protocols / universally composable protocols / oblivious-transfer protocol / OT protocols / candidate PUF-based OT protocol / attacking algorithm / round two-party protocol / two algorithms / honest algorithm / /

SocialTag