The rise of Paillier: homomorphic secret sharing and public-key silent OT

DOI10.1007/978-3-030-77870-5_24zbMath1479.94339OpenAlexW3157351706MaRDI QIDQ2056710

Claudio Orlandi, Sophia Yakoubov, Peter Scholl

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-77870-5_24

zbMATH Keywords

homomorphic secret sharingcorrelated pseudorandomnessdistributed discrete logarithm problem in Paillier groups

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (18)

Large message homomorphic secret sharing from DCR and applications ⋮ Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2\)] ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Distributed (correlation) samplers: how to remove a trusted dealer in one round ⋮ Sublinear-communication secure multiparty computation does not require FHE ⋮ On homomorphic secret sharing from polynomial-modulus LWE ⋮ Pseudorandom correlation functions from variable-density LPN, revisited ⋮ Constrained pseudorandom functions from homomorphic secret sharing ⋮ Sublinear secure computation from new assumptions ⋮ Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Non-interactive secure computation of inner-product from LPN and LWE ⋮ Correlated pseudorandomness from expand-accumulate codes ⋮ An algebraic framework for silent preprocessing with trustless setup and active security ⋮ Scooby: improved multi-party homomorphic secret sharing based on FHE ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN

Cites Work

• Unnamed Item
• Unnamed Item
• Towards optimal simulations of formulas by bounded-width programs
• Homomorphic secret sharing from Paillier encryption
• Two-round MPC: information-theoretic and black-box
• Efficient pseudorandom correlation generators from ring-LPN
• Homomorphic secret sharing from lattices without FHE
• Trapdoor hash functions and their applications
• Efficient pseudorandom correlation generators: silent OT extension and more
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Function Secret Sharing
• A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring
• Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Threshold Cryptosystems Based on Factoring
• Foundations of Homomorphic Secret Sharing
• Fully homomorphic encryption using ideal lattices
• Distributed Point Functions and Their Applications
• Advances in Cryptology - CRYPTO 2003
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: The rise of Paillier: homomorphic secret sharing and public-key silent OT