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

Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Isheeta Nargis

Published Jan 1, 2017• 3 citations
Publisher
DOI
10.1007/978-3-319-57339-7_10

Related papers

A simple generic construction to build oblivious transfer protocols from homomorphic encryption schemes.

Saeid Esmaeilzade, Ziba Eslami, Nasrollah Pakniat

•Jan 1, 2020•0 citations

Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions

Bernardo David, Anderson C. A. Nascimento, Jörn Müller‐Quade

Lecture notes in computer science•Jan 1, 2012•14 citations

A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes

Saeid Esmaeilzade, Nasrollah Pakniat, Ziba Eslami

The Journal of Supercomputing•May 20, 2021•7 citations

Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs

Peter Schöll

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

Efficient Threshold Encryption from Lossy Trapdoor Functions

Xiang Xie, Rui Xue, Rui Zhang

Lecture notes in computer science•Jan 1, 2011•12 citations

Multiparty Computation from Threshold Homomorphic Encryption

Ronald Cramer, Ivan Damgård, Jesper Buus Nielsen

Lecture notes in computer science•Jan 1, 2001•588 citations