Round Optimal Blind Signatures

From MaRDI portal
Publication:5199217

DOI10.1007/978-3-642-22792-9_36zbMath1290.94075OpenAlexW1605357604WikidataQ62038935 ScholiaQ62038935MaRDI QIDQ5199217

Dominique Schröder, Amit Sahai, Sanjam Garg, Vanishree Rao, 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




Related Items (23)

Concurrent Secure Computation via Non-Black Box SimulationPractical Round-Optimal Blind Signatures in the Standard ModelOne-more unforgeability of blind ECDSABlindOR: an efficient lattice-based blind signature scheme from OR-proofsSecurity of blind signatures revisitedShort pairing-free blind signatures with exponential securityBoosting the Security of Blind Signature SchemesRai-Choo! Evolving blind signatures to the next levelA new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor samplingPI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and moreOn pairing-free blind signature schemes in the algebraic group modelConcurrently composable non-interactive secure computationUniversal ring signatures in the standard modelNon-interactive composition of sigma-protocols via Share-then-HashTwo-round maliciously secure computation with super-polynomial simulationMulti-theorem preprocessing NIZKs from latticesRound-optimal blind signatures in the plain model from classical and quantum standard assumptionsPractical Round-Optimal Blind Signatures in the Standard Model from Weaker AssumptionsTwo-Message, Oblivious Evaluation of Cryptographic FunctionalitiesEfficient Round-Optimal Blind Signatures in the Standard ModelLattice-based blind signatures, revisitedBlind Schnorr signatures and signed ElGamal encryption in the algebraic group modelSuccinct non-interactive secure computation




This page was built for publication: Round Optimal Blind Signatures