Secure computation using leaky tokens

Manoj Prabhakaran, Amit Sahai, Akshay Wadia

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Leakage-proof hardware tokens have been used to achieve a large number of cryptographic tasks recently. But in real life, due to various physical attacks, it is extremely difficult to construct hardware devices that are guaranteed to be leakage-proof. In this paper, we study the feasibility of general two-party computation using leaky hardware tokens. Our main result is a completeness theorem that shows that every non-trivial leaky two-party functionality can be used for general secure computation. In fact, the protocol we construct is non-interactive and unconditionally secure. There are no restrictions on the leakage functions associated with the token, except that it does not render the tokens trivial, by revealing its entire secrets to the adversary.

Original languageEnglish (US)
Title of host publicationAutomata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings
Number of pages12
EditionPART 1
ISBN (Print)9783662439470
StatePublished - Jan 1 2014
Event41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark
Duration: Jul 8 2014Jul 11 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume8572 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other41st International Colloquium on Automata, Languages, and Programming, ICALP 2014

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Secure computation using leaky tokens'. Together they form a unique fingerprint.

Cite this