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

Almost Optimal Oblivious Transfer from QA-NIZK

Olivier Blazy, Céline Chevalier, Paul Germouty

Published Jan 1, 2017• 4 citations
Publisher
DOI
10.1007/978-3-319-61204-1_29

Related papers

Boosting CPA to CCA2 for Leakage-Resilient Attribute-Based Encryption by Using New QA-NIZK

Toi Tomita, Wakaha Ogata, Kaoru Kurosawa

In this paper, we construct the first efficient leakage-resilient CCA2 (LR-CCA2)-secure attribute-based encryption (ABE) schemes. We also construct the first efficient LR-CCA2-secure identity-based encryption (IBE) scheme with optimal leakage rate. To obtain our results, we develop a new quasi-adaptive non-interactive zero-knowledge (QA-NIZK) argument for the ciphertext consistency of the LR-CPA-secure schemes. Our ABE schemes are obtained by boosting the LR-CPA-security of some existing schemes to the LR-CCA2-security by using our QA-NIZK arguments. The schemes are almost as efficient as the underlying LR-CPA-secure schemes.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Sep 16, 2021•2 citations

Oblivious Transfer and Applications

Carmit Hazay, Yehuda Lindell

Information security and cryptography•Jan 1, 2010•0 citations

Essentially Optimal Universally Composable Oblivious Transfer

Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi

Lecture notes in computer science•Jan 1, 2009•27 citations

Optimal reductions between oblivious transfers using interactive hashing

Claude Crépeau, George Savvides

•Jan 1, 2006•0 citations

Optimal Reductions Between Oblivious Transfers Using Interactive Hashing

Claude Crépeau, George Savvides

Lecture notes in computer science•Jan 1, 2006•34 citations

On the Oblivious-Transfer Capacity of Noisy Resources

Anderson C. A. Nascimento, Andreas Winter

In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT from a noisy channel/distribution. We show that for honest-but-curious sender, the oblivious-transfer capacity of noisy resources is strictly positive. Several open questions are raised.

IEEE Transactions on Information Theory•May 29, 2008•70 citations
In this paper, we construct the first efficient leakage-resilient CCA2 (LR-CCA2)-secure attribute-based encryption (ABE) schemes. We also construct the first efficient LR-CCA2-secure identity-based encryption (IBE) scheme with optimal leakage rate. To obtain our results, we develop a new quasi-adaptive non-interactive zero-knowledge (QA-NIZK) argument for the ciphertext consistency of the LR-CPA-secure schemes. Our ABE schemes are obtained by boosting the LR-CPA-security of some existing schemes to the LR-CCA2-security by using our QA-NIZK arguments. The schemes are almost as efficient as the underlying LR-CPA-secure schemes.
In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT from a noisy channel/distribution. We show that for honest-but-curious sender, the oblivious-transfer capacity of noisy resources is strictly positive. Several open questions are raised.