Homomorphic secret sharing with verifiable evaluation
From MaRDI portal
Cites work
- A geometric approach to homomorphic secret sharing
- A note on the communication complexity of multiparty computation in the correlated randomness model
- An algebraic framework for silent preprocessing with trustless setup and active security
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Breaking the circuit size barrier for secure computation under DDH
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Circuits resilient to additive attacks with applications to secure computation
- Constant-round interactive proofs for delegating computation
- Constrained pseudorandom functions from homomorphic secret sharing
- Continuous verifiable delay functions
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Distributed Point Functions and Their Applications
- Efficient fully secure computation via distributed zero-knowledge proofs
- Efficient pseudorandom correlation generators: silent OT extension and more
- Fast large-scale honest-majority MPC for malicious adversaries
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
- Foundations of homomorphic secret sharing
- Function secret sharing
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Homomorphic secret sharing for low degree polynomials
- Homomorphic secret sharing from lattices without FHE
- Homomorphic secret sharing from Paillier encryption
- How to delegate computations publicly
- How to prove statements obliviously?
- scientific article; zbMATH DE number 7829303 (Why is no real title available?)
- Large message homomorphic secret sharing from DCR and applications
- Lightweight, maliciously secure verifiable function secret sharing
- Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
- Multiparty Computation from Somewhat Homomorphic Encryption
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Non-interactive zero-knowledge from non-interactive batch arguments
- On the size of pairing-based non-interactive arguments
- PPAD is as hard as LWE and iterated squaring
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Reusable two-round MPC from DDH
- Scooby: improved multi-party homomorphic secret sharing based on FHE
- Secure two-party computation via cut-and-choose oblivious transfer
- Secure two-party computation with low communication
- Short pairing-based non-interactive zero-knowledge arguments
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- SNARGs for P from sub-exponential DDH and QR
- Spooky Encryption and Its Applications
- Sublinear GMW-style compiler for MPC with preprocessing
- Succinct non-interactive arguments via linear interactive proofs
- Sum it up: verifiable additive homomorphic secret sharing
- The hunting of the SNARK
- The Knowledge Complexity of Interactive Proof Systems
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Theory of Cryptography
- Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
- Verifiable homomorphic secret sharing
- Verifiably Multiplicative Secret Sharing
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
This page was built for publication: Homomorphic secret sharing with verifiable evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6955250)
