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 Based on Leaky Correlations: High Resilience Setting

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

Published Jan 1, 2017• 15 citations
Publisher
DOI
10.1007/978-3-319-63715-0_1

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

Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions)

Alexander R. Block, Divya Gupta, Hemanta K. Maji +1 more

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

Secure Computation Using Leaky Tokens

Manoj Prabhakaran, Amit Sahai, Akshay Wadia

Lecture notes in computer science•Jan 1, 2014•3 citations

Barriers in cryptography with weak, correlated and leaky sources

Daniel Wichs

There has been much recent progress in constructing cryptosystems that maintain their security without requiring uniform randomness and perfect secrecy. These schemes are motivated by a diverse set of problems such as providing resilience to side-channel leakage, using weak physical sources of randomness as secret keys, and allowing deterministic encryption for high-entropy messages. Nevertheless, despite this progress, some basic and seemingly achievable security properties have eluded our reach. For example, we are unable to prove the security of basic tools for manipulating weak/leaky random sources, such as as pseudo-entropy generators and seed-dependent computational condensers. We also do not know how to prove leakage-resilient security of any cryptosystem with a uniquely determined secret key. In the context of deterministic encryption we do not have a standard-model constructions achieving the strongest notion of security proposed by Bellare, Boldyreva and O'Neill (CRYPTO '07), that would allow us to encrypt arbitrarily correlated messages of sufficiently large individual entropy.

Conference on Innovations in Theoretical Computer Science•Jan 3, 2013•52 citations

Efficient Perfectly Secure Computation with Optimal Resilience

Ittai Abraham, Gilad Asharov, Avishay Yanai

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

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.

Samuel Ranellucci, Alain Tapp

We construct a very efficient protocol for constant round Two-Party Secure Function Evaluation based on general assumptions. We define and instantiate a leaky variant of Generalized Oblivious Transfer based on Oblivious Transfer and Commitment Schemes. The concepts of Garbling Schemes, Leaky Generalized Oblivious Transfer and Privacy Amplification are combined using the Cut-and-Choose paradigm to obtain the final protocol. Our solution is proven secure in the Universal Composability Paradigm.

•Jan 1, 2013•0 citations
There has been much recent progress in constructing cryptosystems that maintain their security without requiring uniform randomness and perfect secrecy. These schemes are motivated by a diverse set of problems such as providing resilience to side-channel leakage, using weak physical sources of randomness as secret keys, and allowing deterministic encryption for high-entropy messages. Nevertheless, despite this progress, some basic and seemingly achievable security properties have eluded our reach. For example, we are unable to prove the security of basic tools for manipulating weak/leaky random sources, such as as pseudo-entropy generators and seed-dependent computational condensers. We also do not know how to prove leakage-resilient security of any cryptosystem with a uniquely determined secret key. In the context of deterministic encryption we do not have a standard-model constructions achieving the strongest notion of security proposed by Bellare, Boldyreva and O'Neill (CRYPTO '07), that would allow us to encrypt arbitrarily correlated messages of sufficiently large individual entropy.