Practical non-interactive publicly verifiable secret sharing with thousands of parties
From MaRDI portal
Publication:2170010
Recommendations
- A practical (non-interactive) publicly verifiable secret sharing scheme
- Paillier-based publicly verifiable (non-interactive) secret sharing
- scientific article; zbMATH DE number 1418293
- A pairing-based publicly verifiable secret sharing scheme
- A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
Cites work
- scientific article; zbMATH DE number 1618056 (Why is no real title available?)
- scientific article; zbMATH DE number 1618057 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1418293 (Why is no real title available?)
- scientific article; zbMATH DE number 1424186 (Why is no real title available?)
- A Framework for Efficient and Composable Oblivious Transfer
- A pairing-based publicly verifiable secret sharing scheme
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Advances in Cryptology - CRYPTO 2003
- Amortization with fewer equations for proving knowledge of small secrets
- Can a public blockchain keep a secret?
- Commuting signatures and verifiable encryption
- Compressible FHE with applications to PIR
- Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Extensions of Lipschitz mappings into a Hilbert space
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to prove knowledge of small secrets
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- On lattices, learning with errors, random linear codes, and cryptography
- On the concrete hardness of learning with errors
- On the size of pairing-based non-interactive arguments
- Paillier-based publicly verifiable (non-interactive) secret sharing
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Public Verifiability from Pairings in Secret Sharing Schemes
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Publicly verifiable secret sharing
- Publicly verifiable secret sharing for cloud-based key management
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- Sumcheck arguments and their applications
- Universally composable two-party and multi-party secure computation
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Cited in
(23)- : a unified framework for computational verifiable secret sharing
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
- Universally composable auditable surveillance
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- DRAGON: decentralization at the cost of representation after arbitrary GrOupiNg and its applications to sub-cubic DKG and interactive consistency
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Fiat-Shamir transformation of multi-round interactive proofs
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- VSS from distributed ZK proofs and applications
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Efficient and universally composable single secret leader election from pairings
- LaBRADOR: compact proofs for R1CS from Module-SIS
- Willow: secure aggregation with one-shot clients
- Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Bivariate proximity test-based asynchronous verifiable secret sharing
- Aggregating Falcon signatures with LaBRADOR
- \textit{Flood and submerse}: distributed key generation and robust threshold signature from lattices
- Round-optimal, fully secure distributed key generation
- Greyhound: fast polynomial commitments from lattices
- How to prove statements obliviously?
This page was built for publication: Practical non-interactive publicly verifiable secret sharing with thousands of parties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170010)
