Secure computation using leaky tokens

Manoj Prabhakaran; Amit Sahai; Akshay Wadia

doi:10.1007/978-3-662-43948-7_75

Secure computation using leaky tokens

Manoj Prabhakaran, Amit Sahai, Akshay Wadia

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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 language	English (US)
Title of host publication	Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings
Publisher	Springer
Pages	907-918
Number of pages	12
Edition	PART 1
ISBN (Print)	9783662439470
DOIs	https://doi.org/10.1007/978-3-662-43948-7_75
State	Published - 2014
Externally published	Yes
Event	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark Duration: Jul 8 2014 → Jul 11 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	8572 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	41st International Colloquium on Automata, Languages, and Programming, ICALP 2014
Country/Territory	Denmark
City	Copenhagen
Period	7/8/14 → 7/11/14

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Online availability

10.1007/978-3-662-43948-7_75

Library availability

Discover UIUC Full Text

Cite this

Prabhakaran, M., Sahai, A., & Wadia, A. (2014). Secure computation using leaky tokens. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings (PART 1 ed., pp. 907-918). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8572 LNCS, No. PART 1). Springer. https://doi.org/10.1007/978-3-662-43948-7_75

Secure computation using leaky tokens. / Prabhakaran, Manoj; Sahai, Amit; Wadia, Akshay.
Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1. ed. Springer, 2014. p. 907-918 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8572 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Prabhakaran, M, Sahai, A & Wadia, A 2014, Secure computation using leaky tokens. in Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 8572 LNCS, Springer, pp. 907-918, 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014, Copenhagen, Denmark, 7/8/14. https://doi.org/10.1007/978-3-662-43948-7_75

Prabhakaran M, Sahai A, Wadia A. Secure computation using leaky tokens. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer. 2014. p. 907-918. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-662-43948-7_75

@inproceedings{a35228903bc1409aa9c6c548930e30eb,

title = "Secure computation using leaky tokens",

abstract = "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.",

author = "Manoj Prabhakaran and Amit Sahai and Akshay Wadia",

year = "2014",

doi = "10.1007/978-3-662-43948-7_75",

language = "English (US)",

isbn = "9783662439470",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

number = "PART 1",

pages = "907--918",

booktitle = "Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings",

address = "Germany",

edition = "PART 1",

note = "41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 ; Conference date: 08-07-2014 Through 11-07-2014",

}

TY - GEN

T1 - Secure computation using leaky tokens

AU - Prabhakaran, Manoj

AU - Sahai, Amit

AU - Wadia, Akshay

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84904177677&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904177677&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-43948-7_75

DO - 10.1007/978-3-662-43948-7_75

M3 - Conference contribution

AN - SCOPUS:84904177677

SN - 9783662439470

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 907

EP - 918

BT - Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings

PB - Springer

T2 - 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014

Y2 - 8 July 2014 through 11 July 2014

ER -

Secure computation using leaky tokens

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this