Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
From MaRDI portal
Publication:306248
Recommendations
Cites work
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 177618 (Why is no real title available?)
- scientific article; zbMATH DE number 1302840 (Why is no real title available?)
- scientific article; zbMATH DE number 1304079 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1031003 (Why is no real title available?)
- scientific article; zbMATH DE number 1088251 (Why is no real title available?)
- scientific article; zbMATH DE number 1962164 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 2081073 (Why is no real title available?)
- scientific article; zbMATH DE number 2081074 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1504548 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (Why is no real title available?)
- scientific article; zbMATH DE number 1775456 (Why is no real title available?)
- scientific article; zbMATH DE number 1405784 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Adaptively secure non-interactive threshold cryptosystems
- Adaptively secure threshold signature scheme in the standard model
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- How to share a function securely
- How to share a secret
- How to withstand mobile virus attacks (extended abstract)
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Multi-authority secret-ballot elections with linear work
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
- Pairing-Friendly Elliptic Curves of Prime Order
- Practical threshold signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Robust and efficient sharing of RSA functions
- Robust threshold DSS signatures
- Secure distributed key generation for discrete-log based cryptosystems
- Shorter IBE and signatures via asymmetric pairings
- Signatures resilient to continual leakage on memory and computation
- Simplified Threshold RSA with Adaptive and Proactive Security
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Structure-preserving signatures and commitments to group elements
- Threshold Cryptosystems Based on Factoring
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold and revocation cryptosystems via extractable hash proofs
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Unrestricted Aggregate Signatures
Cited in
(11)- Fully adaptive Schnorr threshold signatures
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback
- Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
- Adaptively secure threshold signature scheme in the standard model
- Adaptively secure threshold symmetric-key encryption
- Proof of availability and retrieval in a modular blockchain architecture
- Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
- Threshold structure-preserving signatures
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
This page was built for publication: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306248)
