Efficient one-sided adaptively secure computation

DOI10.1007/S00145-015-9222-4zbMath1370.94517OpenAlexW2217959868MaRDI QIDQ514477

Carmit Hazay, Arpita Patra

Publication date: 2 March 2017

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-015-9222-4

zbMATH Keywords

oblivious transferadaptive securitysecure two-party computationnon-committing encryption

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Adaptively secure MPC with sublinear communication complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Universal classes of hash functions
• Adaptive versus non-adaptive security of multi-party protocols
• How to construct constant-round zero-knowledge proof systems for NP
• Secure two-party computation via cut-and-choose oblivious transfer
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Adaptively Secure Multi-Party Computation with Dishonest Majority
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Semi-homomorphic Encryption and Multiparty Computation
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Universally composable two-party and multi-party secure computation
• Oblivious Transfer Is Symmetric
• A Framework for Efficient and Composable Oblivious Transfer
• Founding Cryptography on Oblivious Transfer – Efficiently
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Adaptively Secure Two-Party Computation with Erasures
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Pseudorandom Generator from any One-way Function
• Foundations of Cryptography
• Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
• Non-committing Encryption from Φ-hiding
• Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
• Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds
• Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology – CRYPTO 2004
• Advances in Cryptology - CRYPTO 2003
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Theory of Cryptography
• One-Sided Adaptively Secure Two-Party Computation

This page was built for publication: Efficient one-sided adaptively secure computation