Spooky Encryption and Its Applications
From MaRDI portal
Publication:2829944
Recommendations
- Progress in Cryptology – Mycrypt 2005
- Homomorphic encryption and applications
- SCARE of secret ciphers with SPN structures
- scientific article; zbMATH DE number 1006115
- Witness encryption and its applications
- scientific article; zbMATH DE number 2009964
- Concealment and its applications to authenticated encryption
- Cryptography with chaos and shadowing
- New insights on AES-like SPN ciphers
- Cryptology: methods, applications and challenges
Cites work
- scientific article; zbMATH DE number 1670844 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Bounded CCA2-Secure Encryption
- Classical hardness of learning with errors
- Delegation for bounded space
- Distributed Point Functions and Their Applications
- Efficient oblivious transfer protocols
- Efficient public-key cryptography in the presence of key leakage
- Function secret sharing
- How to delegate computations
- Maliciously circuit-private FHE
- Multi-identity and multi-key leveled FHE from learning with errors
- Multi-key FHE from LWE, revisited
- Obfuscation of probabilistic circuits and applications
- On lattices, learning with errors, random linear codes, and cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Public-key cryptosystems from the worst-case shortest vector problem
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Spooky Encryption and Its Applications
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Targeted malleability: homomorphic encryption for restricted computations
- The hardness of approximation: Gap location
- Two round multiparty computation via multi-key FHE
- Two-round secure MPC from indistinguishability obfuscation
- \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
Cited in
(47)- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Breaking the circuit size barrier for secure computation under DDH
- Sublinear-communication secure multiparty computation does not require FHE
- Function secret sharing for mixed-mode and fixed-point secure computation
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Rate-1 quantum fully homomorphic encryption
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
- Multikey fully homomorphic encryption and applications
- 10-party sublinear secure computation from standard assumptions
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Pseudorandom correlation functions from variable-density LPN, revisited
- Broadcast-optimal two-round MPC
- On homomorphic secret sharing from polynomial-modulus LWE
- Two-round MPC: information-theoretic and black-box
- CNF-FSS and its applications
- Maliciously secure massively parallel computation for all-but-one corruptions
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- From FE combiners to secure MPC and back
- On the local leakage resilience of linear secret sharing schemes
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Spooky Encryption and Its Applications
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Multi-key homomorphic secret sharing from LWE without multi-key HE
- Foundations of homomorphic secret sharing
- Verifiable decryption in the head
- Correlated pseudorandomness from expand-accumulate codes
- Incrementally verifiable computation via incremental PCPs
- Two-round maliciously-secure oblivious transfer with optimal rate
- Homomorphic secret sharing for low degree polynomials
- Round-optimal and communication-efficient multiparty computation
- Optimal single-server private information retrieval
- Threshold garbled circuits and ad hoc secure computation
- Delegation with updatable unambiguous proofs and PPAD-hardness
- The bottleneck complexity of secure multiparty computation
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
- Post-quantum multi-party computation
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Chosen-Ciphertext Secure Fully Homomorphic Encryption
- Reusable two-round MPC from LPN
- Succinct spooky free compilers are not black box sound
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Distributed (correlation) samplers: how to remove a trusted dealer in one round
- Single-server private information retrieval with sublinear amortized time
This page was built for publication: Spooky Encryption and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829944)
