Title
Lower Bounds in the Hardware Token Model.
Abstract
We study the complexity of secure computation in the tamper-proof hardware token model. Our main focus is on non-interactive unconditional two-party computation using bit-OT tokens, but we also study computational security with stateless tokens that have more complex functionality. Our results can be summarized as follows: - There exists a class of functions such that the number of bit-OT tokens required to securely implement them is at least the size of the sender's input. The same applies for receiver's input size ( with a different class of functionalities). - Non-adaptive protocols in the hardware token model imply efficient (decomposable) randomized encodings. This can be interpreted as evidence to the impossibility of non-adaptive protocols for a large class of functions. - There exists a functionality for which there is no protocol in the stateless hardware token model accessing the tokens at most a constant number of times, even when the adversary is computationally bounded. En route to proving our results, we make interesting connections between the hardware token model and well studied notions such as OT hybrid model, randomized encodings and obfuscation.
Year
Venue
DocType
2013
Lecture Notes in Computer Science
Journal
Volume
ISSN
Citations 
8349
0302-9743
1
PageRank 
References 
Authors
0.35
32
5
Name
Order
Citations
PageRank
Shashank Agrawal114814.06
Prabhanjan Ananth223418.43
Vipul Goyal32859129.53
Manoj Prabhakaran410.35
Alon Rosen5136060.54