Efficient one-sided adaptively secure computation

DOI10.1007/S00145-015-9222-4zbMATH Open1370.94517OpenAlexW2217959868MaRDI QIDQ514477FDOQ514477

Authors: 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

Recommendations

• One-Sided Adaptively Secure Two-Party Computation
• Adaptive security with quasi-optimal rate
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Adaptively secure computation with partial erasures
• scientific article; zbMATH DE number 1256784

zbMATH Keywords

oblivious transferadaptive securitysecure two-party computationnon-committing encryption

Mathematics Subject Classification ID

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

Cites Work

• Universal classes of hash functions
• A Pseudorandom Generator from any One-way Function
• Title not available (Why is that?)
• A proof of security of Yao's protocol for two-party computation
• How to construct constant-round zero-knowledge proof systems for NP
• Secure two-party computation via cut-and-choose oblivious transfer
• Multiparty Computation from Somewhat Homomorphic Encryption
• A New Approach to Practical Active-Secure Two-Party Computation
• Oblivious Transfer Is Symmetric
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Title not available (Why is that?)
• A Framework for Efficient and Composable Oblivious Transfer
• Title not available (Why is that?)
• Semi-homomorphic encryption and multiparty computation
• Founding Cryptography on Oblivious Transfer – Efficiently
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Universally composable two-party and multi-party secure computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of Cryptography
• Adaptive versus non-adaptive security of multi-party protocols
• An efficient protocol for secure two-party computation in the presence of malicious adversaries
• Adaptively Secure Multi-Party Computation with Dishonest Majority
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Simple, Black-Box Constructions of Adaptively Secure Protocols
• Adaptively Secure Two-Party Computation with Erasures
• Improved non-committing encryption with applications to adaptively secure protocols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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 2003
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• One-Sided Adaptively Secure Two-Party Computation

Cited In (3)

• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Adaptively secure MPC with sublinear communication complexity
• One-Sided Adaptively Secure Two-Party Computation

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

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