Pages that link to "Item:Q2835599"
From MaRDI portal
The following pages link to Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599):
Displaying 50 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- Secure multiparty computation with free branching (Q2170008) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- NIKE from affine determinant programs (Q2697912) (← links)
- (Q4638056) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Master-Key KDM-Secure IBE from Pairings (Q5041155) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing (Q5918863) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
- Multi-key homomorphic secret sharing from LWE without multi-key HE (Q6535488) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Rate-1 fully local somewhere extractable hashing from DDH (Q6635830) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
- Succinct homomorphic secret sharing (Q6637573) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
