Efficient oblivious transfer from lossy threshold homomorphic encryption

DOI10.1007/978-3-319-57339-7_10MaRDI QIDQ4975186zbMATH OpenOpenAlexFDO

Authors Isheeta Nargis

Publication date 4 August 2017

Published in Progress in Cryptology - AFRICACRYPT 2017 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-57339-7_10

zbMATH Keywords

active adversaryhomomorphic encryptionlossy encryptionoblivious transferone-sided adaptive adversarypublic key encryptionthreshold encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1302802
• Efficient fully-simulatable oblivious transfer
• Efficient oblivious transfer protocols
• Efficient adaptive oblivious transfer without q-type assumptions in UC framework
• The simplest protocol for oblivious transfer

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• Adaptive and composable non-committing encryptions
• Efficient concurrent zero-knowledge in the auxiliary string model
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Efficient signature generation by smart cards
• scientific article; zbMATH DE number 5009201 (Why is no real title available?)
• scientific article; zbMATH DE number 3912454 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• scientific article; zbMATH DE number 1759794 (Why is no real title available?)
• scientific article; zbMATH DE number 1418290 (Why is no real title available?)
• Improved non-committing encryption with applications to adaptively secure protocols
• One-Sided Adaptively Secure Two-Party Computation
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Security and composition of multiparty cryptographic protocols
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer

Cited in

(4)

• Efficient and tight oblivious transfer from PKE with tight multi-user security
• New Communication-Efficient Oblivious Transfer Protocols Based on Pairings
• Efficient oblivious transfer from lossy threshold homomorphic encryption
• Efficient oblivious transfer for one-sided active adaptive adversaries

This page was built for publication: Efficient oblivious transfer from lossy threshold homomorphic encryption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4975186)