Multi-party revocation in sovrin: performance through distributed trust
From MaRDI portal
Publication:826287
DOI10.1007/978-3-030-75539-3_22OpenAlexW3038063369MaRDI QIDQ826287
Daniel Kales, Roman Walch, Lukas Helminger, Sebastian Ramacher
Publication date: 20 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75539-3_22
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Updatable and universal common reference strings with applications to zk-SNARKs
- Universally composable accumulators
- Pairings for cryptographers
- Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
- Fast distributed RSA key generation for semi-honest and malicious adversaries
- Updating key size estimations for pairings
- Distributing any elliptic curve based protocol
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Scalable zero knowledge with no trusted setup
- Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- How to share a secret
- Advances in Cryptology - CRYPTO 2003
- Topics in Cryptology – CT-RSA 2005
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Multiparty generation of an RSA modulus
This page was built for publication: Multi-party revocation in sovrin: performance through distributed trust
