Non-interactive blind signatures for random messages

DOI10.1007/978-3-031-30589-4_25MaRDI QIDQ6083686zbMATH OpenOpenAlexFDO

Authors Lucjan Hanzlik

Publication date 8 December 2023

Published in Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30589-4_25

zbMATH Keywords

blind signaturesnon-interactive schemerandom oracle modelsignatures on equivalence classes

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Concurrent Blind Signatures Without Random Oracles
• Rai-Choo! Evolving blind signatures to the next level
• Pairing-free blind signatures from standard assumptions in the ROM
• A framework for universally composable non-committing blind signatures
• Efficient round-optimal blind signatures in the standard model

Cites work

• A modular treatment of blind signatures from identification schemes
• An airdrop that preserves recipient privacy
• Compact E-Cash
• Defeating Malicious Servers in a Blind Signatures Based Voting System
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Efficient Round Optimal Blind Signatures
• scientific article; zbMATH DE number 1583811 (Why is no real title available?)
• scientific article; zbMATH DE number 3825707 (Why is no real title available?)
• scientific article; zbMATH DE number 1302799 (Why is no real title available?)
• scientific article; zbMATH DE number 1088232 (Why is no real title available?)
• scientific article; zbMATH DE number 1952905 (Why is no real title available?)
• scientific article; zbMATH DE number 2081086 (Why is no real title available?)
• scientific article; zbMATH DE number 1759330 (Why is no real title available?)
• scientific article; zbMATH DE number 1759331 (Why is no real title available?)
• Lattice-based blind signatures, revisited
• Limits of provable security from standard assumptions
• On the impossibility of three-move blind signature schemes
• Pairing-Friendly Elliptic Curves of Prime Order
• PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
• Practical Compact E-Cash
• Practical Round-Optimal Blind Signatures in the Standard Model
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Security arguments for digital signatures and blind signatures
• Security of Blind Signatures under Aborts
• Simulatable Adaptive Oblivious Transfer
• Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
• Structure-Preserving Signatures on Equivalence Classes and Their Application to Anonymous Credentials
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

Cited in

(10)

• Concurrent Blind Signatures Without Random Oracles
• On proving equivalence class signatures secure from non-interactive assumptions
• Non-interactive blind signatures from RSA assumption and more
• Stronger security for threshold blind signatures
• Non-interactive blind signatures: post-quantum and stronger security
• On security proofs of existing equivalence class signature schemes
• On the limits of non-interactive blind signatures
• On non-interactive blind signatures in the plain model using complexity leveraging
• Tight reductions for SIS-with-hints assumptions with applications to anonymous credentials
• Batched \& non-interactive blind signatures from lattices

This page was built for publication: Non-interactive blind signatures for random messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083686)