Round optimal blind signatures

DOI10.1007/978-3-642-22792-9_36MaRDI QIDQ5199217zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh

Publication date 12 August 2011

Published in Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22792-9_36

Mathematics Subject Classification ID

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

Recommendations

• Practical Round-Optimal Blind Signatures in the Standard Model
• Efficient Round Optimal Blind Signatures
• 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

Cited in

(38)

• Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
• Lattice-based blind signatures, revisited
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Succinct non-interactive secure computation
• One-more unforgeability of blind ECDSA
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• Short pairing-free blind signatures with exponential security
• Security of blind signatures revisited
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Two-round maliciously secure computation with super-polynomial simulation
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Two-message, oblivious evaluation of cryptographic functionalities
• Compact Round-Optimal Partially-Blind Signatures
• Concurrent secure computation via non-black box simulation
• Practical Round-Optimal Blind Signatures in the Standard Model
• On the impossibility of three-move blind signature schemes
• Efficient Round Optimal Blind Signatures
• Round-Optimal Blind Signatures from Waters Signatures
• Round-Optimal Composable Blind Signatures in the Common Reference String Model
• Efficient round-optimal blind signatures in the standard model
• A short paper on blind signatures from knowledge assumptions
• Multi-theorem preprocessing NIZKs from lattices
• Boosting the Security of Blind Signature Schemes
• Rai-Choo! Evolving blind signatures to the next level
• A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
• PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
• On pairing-free blind signature schemes in the algebraic group model
• Concurrently composable non-interactive secure computation
• Universal ring signatures in the standard model
• Concurrently secure blind Schnorr signatures
• Pairing-free blind signatures from standard assumptions in the ROM
• Practical blind signatures in pairing-free groups
• Non-interactive blind signatures: post-quantum and stronger security
• Tightly-secure blind signatures in pairing-free groups
• On the limits of non-interactive blind signatures
• On non-interactive blind signatures in the plain model using complexity leveraging
• Batched \& non-interactive blind signatures from lattices
• Post-quantum (partially) blind signatures from matrix code equivalence

This page was built for publication: Round optimal blind signatures

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