Efficient one-sided adaptively secure computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 1261819 (Why is no real title available?)
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- scientific article; zbMATH DE number 1088227 (Why is no real title available?)
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2043334 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- scientific article; zbMATH DE number 1406779 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A Pseudorandom Generator from any One-way Function
- A new approach to practical active-secure two-party computation
- A proof of security of Yao's protocol for two-party computation
- Adaptive versus non-adaptive security of multi-party protocols
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation
- Adaptively Secure Two-Party Computation with Erasures
- Adaptively secure multi-party computation with dishonest majority
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Foundations of Cryptography
- Founding Cryptography on Oblivious Transfer – Efficiently
- How to construct constant-round zero-knowledge proof systems for NP
- Improved non-committing encryption with applications to adaptively secure protocols
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-committing encryption from \(\Phi\)-hiding
- Oblivious Transfer Is Symmetric
- One-Sided Adaptively Secure Two-Party Computation
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure two-party computation via cut-and-choose oblivious transfer
- Semi-homomorphic encryption and multiparty computation
- Simple, Black-Box Constructions of Adaptively Secure Protocols
- Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
- Theory of Cryptography
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation
- Universal classes of hash functions
- Universally composable two-party and multi-party secure computation
Cited in
(4)
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)
