Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
From MaRDI portal
Publication:6637544
Recommendations
- A practical and provably secure scheme for publicly verifiable secret sharing and its applications
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Publication:4941853
- A practical (non-interactive) publicly verifiable secret sharing scheme
- Paillier-based publicly verifiable (non-interactive) secret sharing
Cites work
- scientific article; zbMATH DE number 1618057 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (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 practical and provably secure scheme for publicly verifiable secret sharing and its applications
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Aggregatable distributed key generation
- Bandwidth-efficient threshold EC-DSA
- Can a public blockchain keep a secret?
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Encryption switching protocols revisited: switching modulo \(p\)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees
- Fluid MPC: secure multiparty computation with dynamic participants
- I want to ride my \texttt{BICYCL} : \texttt{BICYCL} implements cryptography in class groups
- Le Mans: dynamic and fluid MPC for dishonest majority
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- On the Non-malleability of the Fiat-Shamir Transform
- Perfect MPC over layered graphs
- Practical fully secure unrestricted inner product functional encryption modulo \(p\)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Public Verifiability from Pairings in Secret Sharing Schemes
- Publicly verifiable secret sharing
- Random-index PIR and applications
- SCALES. MPC with small clients and larger ephemeral servers
- SCRAPE: scalable randomness attested by public entities
- Secure multiparty computation from threshold encryption based on class groups
- Two-party ECDSA from hash proof systems and efficient instantiations
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
This page was built for publication: Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637544)
