Pages that link to "Item:Q2845661"
From MaRDI portal
The following pages link to Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based (Q2845661):
Displayed 50 items.
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Trusted computing with addition machines. I (Q681716) (← links)
- A new scale-invariant homomorphic encryption scheme (Q781008) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Homomorphic lower digits removal and improved FHE bootstrapping (Q1648799) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- An efficient quantum somewhat homomorphic symmetric searchable encryption (Q1705121) (← links)
- Unsupervised Machine Learning on encrypted data (Q1726695) (← links)
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function (Q2056708) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme (Q2056805) (← links)
- An efficient CCA-secure access control encryption for any policy (Q2057135) (← links)
- Bootstrapping fully homomorphic encryption over the integers in less than one second (Q2061925) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Flexible and efficient verifiable computation on encrypted data (Q2061972) (← links)
- Integer polynomial recovery from outputs and its application to cryptanalysis of a protocol for secure sorting (Q2079218) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Access control encryption from group encryption (Q2117042) (← links)
- Password protected secret sharing from lattices (Q2117043) (← links)
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem (Q2118564) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Counterexamples to new circular security assumptions underlying iO (Q2128580) (← links)
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security (Q2132442) (← links)
- White box traitor tracing (Q2139638) (← links)
- Universal product learning with errors: a new variant of \textsf{LWE} for lattice-based cryptography (Q2143125) (← links)
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model (Q2148757) (← links)
- Transciphering, using FiLIP and TFHE for an efficient delegation of computation (Q2152020) (← links)
- On a dual/hybrid approach to small secret LWE. A dual/enumeration technique for learning with errors and application to security estimates of FHE schemes (Q2152045) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems (Q2161427) (← links)
- Tightly secure ring-LWE based key encapsulation with short ciphertexts (Q2167708) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Compressible FHE with applications to PIR (Q2175949) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)