Theory of Cryptography

DOI10.1007/11681878zbMATH Open1112.94018OpenAlexW3149533473MaRDI QIDQ5898643FDOQ5898643

Authors Tatsuaki Okamoto 

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11681878

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient round-optimal blind signatures in the standard model
• Security in Communication Networks
• Efficient Partially Blind Signatures with Provable Security
• Concurrent Blind Signatures Without Random Oracles
• Compact Round-Optimal Partially-Blind Signatures

Cited In (45)

• Tight security for signature schemes without random oracles
• Efficient Round Optimal Blind Signatures
• Secure identity-based blind signature scheme in the standard model
• Boosting the Security of Blind Signature Schemes
• Round-Optimal Blind Signatures from Waters Signatures
• Unconditionally Secure Blind Authentication Codes: The Model, Constructions, and Links to Commitment
• The Abe-Okamoto partially blind signature scheme revisited
• One-Round ID-Based Blind Signature Scheme without ROS Assumption
• Elliptic curve cryptography; applications, challenges, recent advances, and future trends: a comprehensive survey
• Short signatures from Diffie-Hellman: realizing almost compact public key
• Efficient Provably Secure Restrictive Partially Blind Signatures from Bilinear Pairings
• Structure-preserving signatures and commitments to group elements
• Programmable hash functions and their applications
• Equivocal Blind Signatures and Adaptive UC-Security
• Security in Communication Networks
• Sub-linear Blind Ring Signatures without Random Oracles
• Security of blind signatures revisited
• Blind Identity-Based Encryption and Simulatable Oblivious Transfer
• Title not available (Why is no real title available?)
• Discrete logarithm problems with auxiliary inputs
• Identity-based partially blind signature in the standard model for electronic cash
• PAPR: publicly auditable privacy revocation for anonymous credentials
• Title not available (Why is no real title available?)
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• Efficient round-optimal blind signatures in the standard model
• Short pairing-free blind signatures with exponential security
• An efficient blind signature scheme based on SM2 signature algorithm
• Rai-Choo! Evolving blind signatures to the next level
• PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
• Concurrently secure blind Schnorr signatures
• Lattice-based blind signatures, revisited
• Efficient Partially Blind Signatures with Provable Security
• Efficient Partially Blind Signature Scheme with Provable Security
• On pairing-free blind signature schemes in the algebraic group model
• ID-based public key cryptographic systems
• On blindness of several ElGamal-type blind signatures
• Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
• Provably secure randomized blind signature scheme based on bilinear pairing
• Compact Round-Optimal Partially-Blind Signatures
• MoniPoly -- an expressive \(q\)-SDH-based anonymous attribute-based credential system
• An identity-based strongly unforgeable signature without random oracles from bilinear pairings
• Two faces of blindness
• A Framework for Universally Composable Non-committing Blind Signatures
• Concurrent Blind Signatures Without Random Oracles
• Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

This page was built for publication: Theory of Cryptography

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