Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
From MaRDI portal
Publication:306248
DOI10.1016/J.TCS.2016.02.031zbMath1353.94059OpenAlexW2328007342MaRDI QIDQ306248
Benoît Libert, Marc Joye, Mordechai M. Yung
Publication date: 31 August 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.031
efficiencyfault toleranceavailabilityadaptive securitydistributed key generationerasure-freenessfully distributed schemesnon-interactivitythreshold signatures
Related Items (5)
Adaptively secure threshold symmetric-key encryption ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Jolteon and Ditto: network-adaptive efficient consensus with asynchronous fallback ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Fully adaptive Schnorr threshold signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure distributed key generation for discrete-log based cryptosystems
- How to share a function securely
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Multi-Authority Secret-Ballot Elections with Linear Work
- Robust Threshold DSS Signatures
- Non-interactive CCA-Secure Threshold Cryptosystems with Adaptive Security: New Framework and Constructions
- Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Signatures Resilient to Continual Leakage on Memory and Computation
- Threshold and Revocation Cryptosystems via Extractable Hash Proofs
- Adaptively Secure Non-interactive Threshold Cryptosystems
- How to share a secret
- Randomizable Proofs and Delegatable Anonymous Credentials
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient, Robust and Constant-Round Distributed RSA Key Generation
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Robust and Efficient Sharing of RSA Functions
- Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
- Structure-Preserving Signatures and Commitments to Group Elements
- Simplified Threshold RSA with Adaptive and Proactive Security
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
- Threshold Cryptosystems Based on Factoring
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Shorter IBE and Signatures via Asymmetric Pairings
- How to withstand mobile virus attacks (extended abstract)
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Pairing-Friendly Elliptic Curves of Prime Order
- Unrestricted Aggregate Signatures
- Efficient Non-interactive Proof Systems for Bilinear Groups
This page was built for publication: Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
