Practical non-interactive publicly verifiable secret sharing with thousands of parties
From MaRDI portal
Publication:2170010
DOI10.1007/978-3-031-06944-4_16zbMath1496.94078OpenAlexW3204983216MaRDI QIDQ2170010
Shai Halevi, Vadim Lyubashevsky, Craig Gentry
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_16
Related Items (5)
Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Paillier-based publicly verifiable (non-interactive) secret sharing
- A pairing-based publicly verifiable secret sharing scheme
- On the concrete hardness of learning with errors
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Amortization with fewer equations for proving knowledge of small secrets
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Can a public blockchain keep a secret?
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Sumcheck arguments and their applications
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- How to Prove Knowledge of Small Secrets
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Publicly Verifiable Secret Sharing
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
- Commuting Signatures and Verifiable Encryption
- Publicly Verifiable Secret Sharing for Cloud-Based Key Management
- Extensions of Lipschitz mappings into a Hilbert space
- Universally composable two-party and multi-party secure computation
- A Framework for Efficient and Composable Oblivious Transfer
- Public Verifiability from Pairings in Secret Sharing Schemes
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Advances in Cryptology - CRYPTO 2003
- Lattice-Based Identification Schemes Secure Under Active Attacks
- On the Size of Pairing-Based Non-interactive Arguments
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Practical non-interactive publicly verifiable secret sharing with thousands of parties
