Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares

DOI10.1016/J.TCS.2016.02.031zbMATH Open1353.94059OpenAlexW2328007342MaRDI QIDQ306248FDOQ306248

Authors: Benoît Libert, Marc Joye, Moti 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

Recommendations

• Born and raised distributively
• Adaptively secure non-interactive threshold cryptosystems
• Adaptively secure non-interactive threshold cryptosystems
• Adaptively secure threshold signature scheme in the standard model
• Adaptively secure forward-secure non-interactive threshold cryptosystems

zbMATH Keywords

efficiencyfault toleranceavailabilityadaptive securitydistributed key generationerasure-freenessfully distributed schemesnon-interactivitythreshold signatures

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• How to share a secret
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Title not available (Why is that?)
• Efficient Identity-Based Encryption Without Random Oracles
• Pairing-Friendly Elliptic Curves of Prime Order
• Title not available (Why is that?)
• How to share a function securely
• Non-interactive CCA-secure threshold cryptosystems with adaptive security: New framework and constructions
• Adaptively secure non-interactive threshold cryptosystems
• An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract)
• Linearly Homomorphic Structure-Preserving Signatures and Their Applications
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Signatures resilient to continual leakage on memory and computation
• Structure-preserving signatures and commitments to group elements
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Title not available (Why is that?)
• Multi-Authority Secret-Ballot Elections with Linear Work
• Robust Threshold DSS Signatures
• Tools for simulating features of composite order bilinear groups in the prime order setting
• Threshold and revocation cryptosystems via extractable hash proofs
• Title not available (Why is that?)
• Randomizable Proofs and Delegatable Anonymous Credentials
• Title not available (Why is that?)
• Practical threshold signatures
• Efficient, Robust and Constant-Round Distributed RSA Key Generation
• Robust and Efficient Sharing of RSA Functions
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Simplified Threshold RSA with Adaptive and Proactive Security
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Threshold Cryptosystems Based on Factoring
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Shorter IBE and signatures via asymmetric pairings
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to withstand mobile virus attacks (extended abstract)
• Advances in Cryptology – CRYPTO 2004
• Unrestricted Aggregate Signatures
• Adaptively secure threshold signature scheme in the standard model
• Secure distributed key generation for discrete-log based cryptosystems

Cited In (10)

• Threshold structure-preserving signatures
• Proof of availability and retrieval in a modular blockchain architecture
• Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony!
• 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
• Fully adaptive Schnorr threshold signatures
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Threshold structure-preserving signatures: strong and adaptive security under standard assumptions
• Adaptively secure threshold symmetric-key encryption
• Adaptively secure threshold signature scheme in the standard model

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)