An algebraic framework for silent preprocessing with trustless setup and active security
From MaRDI portal
Publication:6166960
Recommendations
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- An Architecture for Provably Secure Computation
- Secure computation with preprocessing via function secret sharing
- Algorithmic Tamper-Proof Security under Probing Attacks
- Efficient multi-party computation: from passive to active security via secure SIMD circuits
- Better preprocessing for secure multiparty computation
- An algebraic approach to maliciously secure private set intersection
- Secure multiparty computation with sublinear preprocessing
- Almost-Everywhere Secure Computation
- scientific article; zbMATH DE number 1834562
Cites work
- A new public-key cryptosystem over a quadratic order with quadratic decryption time.
- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order
- Breaking the circuit size barrier for secure computation under DDH
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Efficient noninteractive certification of RSA moduli and beyond
- Efficient pseudorandom correlation generators: silent OT extension and more
- Efficient range proofs with transparent setup from bounded integer commitments
- Factoring \(pq ^{2}\) with quadratic forms: Nice cryptanalyses
- Founding Cryptography on Oblivious Transfer – Efficiently
- Homomorphic secret sharing from lattices without FHE
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1256680 (Why is no real title available?)
- scientific article; zbMATH DE number 2043334 (Why is no real title available?)
- Large message homomorphic secret sharing from DCR and applications
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Non-interactive Zero-Knowledge Arguments for Voting
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
Cited in
(25)- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- New ways to garble arithmetic circuits
- Sublinear-communication secure multiparty computation does not require FHE
- Constrained pseudorandom functions from homomorphic secret sharing
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Sublinear secure computation from new assumptions
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Secure multiparty computation from threshold encryption based on class groups
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Constant-round simulation-secure coin tossing extension with guaranteed output
- Succinct homomorphic secret sharing
- 10-party sublinear secure computation from standard assumptions
- A unified framework for succinct garbling from homomorphic secret sharing
- Enhanced trapdoor hashing from DDH and DCR
- Multi-key homomorphic secret sharing
- Non-interactive distributed point functions
- Homomorphic secret sharing with verifiable evaluation
- A note on low-communication secure multiparty computation via circuit depth-reduction
- Direct FSS constructions for branching programs and more from PRGs with encoded-output homomorphism
- Succinct line-point zero-knowledge arguments from homomorphic secret sharing
- Threshold homomorphic secret sharing: definitions and constructions
- Multiparty homomorphic secret sharing and more from LPN and MQ
- Computationally succinct authentication from DCR. Attribute-based laconic function evaluation and more
- Client-server homomorphic secret sharing in the CRS model
- \textsf{Zebra}: arithmetic garbled RAM for large words from DCR
This page was built for publication: An algebraic framework for silent preprocessing with trustless setup and active security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166960)
