Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

DOI10.1007/978-3-319-57339-7_10zbMath1408.94955OpenAlexW2604442547MaRDI QIDQ4975186

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

oblivious transferhomomorphic encryptionpublic key encryptionlossy encryptionthreshold encryptionactive adversaryone-sided adaptive adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Efficient signature generation by smart cards
• Security and composition of multiparty cryptographic protocols
• Security against covert adversaries: Efficient protocols for realistic adversaries
• Adaptive and Composable Non-committing Encryptions
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• A Framework for Efficient and Composable Oblivious Transfer
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption
• One-Sided Adaptively Secure Two-Party Computation

This page was built for publication: Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption