Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Secure Computation Using Leaky Tokens

Manoj Prabhakaran, Amit Sahai, Akshay Wadia

Published Jan 1, 2014• 3 citations
Publisher
DOI
10.1007/978-3-662-43948-7_75

Related papers

Secure Computation from Leaky Correlated Randomness

Divya Gupta, Yuval Ishai, Hemanta K. Maji +1 more

Lecture notes in computer science•Jan 1, 2015•7 citations

Universally Composable Secure Computation with Corrupted Tokens

Nishanth Chandran, Wutichai Chongchitmate, Rafail Ostrovsky +1 more

Lecture notes in computer science•Jan 1, 2019•6 citations

Secure Computation Based on Leaky Correlations: High Resilience Setting

Alexander R. Block, Hemanta K. Maji, Hai H. Nguyen

Lecture notes in computer science•Jan 1, 2017•15 citations

Lower Bounds in the Hardware Token Model.

Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal +2 more

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 to-kens, but we also study computational security with stateless tokens that have more complex functionality. Our results can be summarized as follows: • We show that 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). • We investigate the existence of non-adaptive protocols in the hardware token model. In a non-adaptive protocol, the queries to the tokens are fixed in advance as against an adaptive protocol in which the queries can depend on the answers from the previously queried tokens. In this work, we show that the existence of non-adaptive protocols in the hardware token model imply efficient (decomposable) randomized encodings. Since, efficient decomposable randomized encodings are believed to not exist for all efficient functions, this result can be interpreted as an evidence to the impossibility of non-adaptive protocols for efficiently

•Jan 1, 2013•0 citations

Secure Computation

Silvio M. Micali, Phillip Rogaway

Springer eBooks•Aug 11, 2007•162 citations

Unconditionally Secure Computation Against Low-Complexity Leakage

Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan

Journal of Cryptology•Aug 9, 2021•6 citations
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 to-kens, but we also study computational security with stateless tokens that have more complex functionality. Our results can be summarized as follows: • We show that 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). • We investigate the existence of non-adaptive protocols in the hardware token model. In a non-adaptive protocol, the queries to the tokens are fixed in advance as against an adaptive protocol in which the queries can depend on the answers from the previously queried tokens. In this work, we show that the existence of non-adaptive protocols in the hardware token model imply efficient (decomposable) randomized encodings. Since, efficient decomposable randomized encodings are believed to not exist for all efficient functions, this result can be interpreted as an evidence to the impossibility of non-adaptive protocols for efficiently