Secure Outsourced Computation
From MaRDI portal
Publication:3011899
DOI10.1007/978-3-642-21969-6_1zbMath1280.94080OpenAlexW1825176194MaRDI QIDQ3011899
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_1
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Player simulation and general adversary structures in perfect multiparty computation
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- How to share a secret
- From Passive to Covert Security at Low Cost
- Founding Cryptography on Tamper-Proof Hardware Tokens
- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens
- Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
- Fully Homomorphic Encryption over the Integers
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Asynchronous Multiparty Computation: Theory and Implementation
- Secure Multiparty Computation Goes Live
- Fully homomorphic encryption using ideal lattices
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Universally Composable Multi-party Computation Using Tamper-Proof Hardware
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- New Constructions for UC Secure Computation Using Tamper-Proof Hardware
- Secure Multiparty Computation and Secret Sharing
- Theory of Cryptography
This page was built for publication: Secure Outsourced Computation
