Spooky Encryption and Its Applications
From MaRDI portal
Publication:2829944
DOI10.1007/978-3-662-53015-3_4zbMath1406.94045OpenAlexW2494395658MaRDI QIDQ2829944
Shai Halevi, Daniel Wichs, Yevgeniy Dodis, Ron D. Rothblum
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_4
Related Items
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO, Two-round MPC: information-theoretic and black-box, Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model, Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials, Round-optimal and communication-efficient multiparty computation, Distributed (correlation) samplers: how to remove a trusted dealer in one round, Single-server private information retrieval with sublinear amortized time, Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings, Reusable Two-Round MPC from LPN, CNF-FSS and Its Applications, From FE combiners to secure MPC and back, Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles, Incrementally verifiable computation via incremental PCPs, Sublinear-communication secure multiparty computation does not require FHE, On homomorphic secret sharing from polynomial-modulus LWE, Pseudorandom correlation functions from variable-density LPN, revisited, Verifiable decryption in the head, Scooby: improved multi-party homomorphic secret sharing based on FHE, Optimal single-server private information retrieval, Multikey Fully Homomorphic Encryption and Applications, Maliciously secure massively parallel computation for all-but-one corruptions, Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials, Correlated pseudorandomness from expand-accumulate codes, Unnamed Item, Scooby: improved multi-party homomorphic secret sharing based on FHE, Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions, Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN, Rate-1 quantum fully homomorphic encryption, Somewhere statistical soundness, post-quantum security, and SNARGs, Homomorphic secret sharing for low degree polynomials, Foundations of Homomorphic Secret Sharing, Chosen-Ciphertext Secure Fully Homomorphic Encryption, Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation, On the local leakage resilience of linear secret sharing schemes, Post-quantum multi-party computation, The rise of Paillier: homomorphic secret sharing and public-key silent OT, Function secret sharing for mixed-mode and fixed-point secure computation, Threshold garbled circuits and ad hoc secure computation, Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments, Spooky Encryption and Its Applications, Breaking the Circuit Size Barrier for Secure Computation Under DDH, Delegation with updatable unambiguous proofs and PPAD-hardness, Broadcast-optimal two-round MPC
Cites Work
- Unnamed Item
- Unnamed Item
- The hardness of approximation: Gap location
- Targeted malleability
- Spooky Encryption and Its Applications
- Maliciously Circuit-Private FHE
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Function Secret Sharing
- Efficient Public-Key Cryptography in the Presence of Key Leakage
- Multi-key FHE from LWE, Revisited
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Bounded CCA2-Secure Encryption
- i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
- Public-key cryptosystems from the worst-case shortest vector problem
- How to delegate computations
- Obfuscation of Probabilistic Circuits and Applications
- Advances in Cryptology – CRYPTO 2004
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Distributed Point Functions and Their Applications
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Delegation for bounded space
- Classical hardness of learning with errors
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
