Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
From MaRDI portal
Cites work
- A fast and simple partially oblivious PRF, with applications
- Adaptively secure BLS threshold signatures from DDH and co-CDH
- Adaptively secure three-round threshold Schnorr signatures from DDH
- Advances in Cryptology – CRYPTO 2004
- Algebraic adversaries in the universal composability framework
- Bandwidth-efficient threshold EC-DSA
- Better than advertised security for non-interactive threshold signatures
- Born and raised distributively, fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Factoring polynomials over finite fields: A survey
- Fast secure computation of set intersection
- Fast secure two-party ECDSA signing
- Fast threshold ECDSA with honest majority
- FROST: Flexible round-optimized Schnorr threshold signatures
- Fully adaptive Schnorr threshold signatures
- Glacius: threshold Schnorr signatures from DDH with full adaptive security
- scientific article; zbMATH DE number 1722675 (Why is no real title available?)
- scientific article; zbMATH DE number 3825707 (Why is no real title available?)
- scientific article; zbMATH DE number 1263216 (Why is no real title available?)
- scientific article; zbMATH DE number 2080670 (Why is no real title available?)
- scientific article; zbMATH DE number 2081074 (Why is no real title available?)
- scientific article; zbMATH DE number 1504548 (Why is no real title available?)
- scientific article; zbMATH DE number 1759662 (Why is no real title available?)
- scientific article; zbMATH DE number 1842503 (Why is no real title available?)
- scientific article; zbMATH DE number 1418290 (Why is no real title available?)
- Number-theoretic constructions of efficient pseudo-random functions
- OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
- Pairing-free blind signatures from CDH assumptions
- Pairing-free blind signatures from standard assumptions in the ROM
- Pairings for cryptographers
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Practical Schnorr threshold signatures without the algebraic group model
- Publicly verifiable secret sharing
- Rai-Choo! Evolving blind signatures to the next level
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Security arguments for digital signatures and blind signatures
- Short pairing-free blind signatures with exponential security
- Short signatures from the Weil pairing
- Simplified Threshold RSA with Adaptive and Proactive Security
- Snowblind: a threshold blind signature in pairing-free groups
- Stronger security for threshold blind signatures
- Theory of Cryptography
- Threshold PAKE with security against compromise of all servers
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
- Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security
- TOPPSS: cost-minimal password-protected secret sharing based on threshold OPRF
- Twinkle: threshold signatures from DDH with full adaptive security
- Universal Electronic Cash
This page was built for publication: Adaptively secure threshold blind BLS signatures and threshold oblivious PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232703)
