scientific article; zbMATH DE number 708798
From MaRDI portal
Publication:4318686
zbMATH Open0809.94008MaRDI QIDQ4318686FDOQ4318686
Authors: Tatsuaki Okamoto 
Publication date: 4 April 1995
Title of this publication is not available (Why is that?)
Recommendations
Cited In (only showing first 100 items - show all)
- A Schnorr-Like Lightweight Identity-Based Signature Scheme
- Identity based identification from algebraic coding theory
- Identification protocols and signature schemes based on supersingular isogeny problems
- Boosting the Security of Blind Signature Schemes
- Identification scheme and forward-secure signature in identity-based setting from isogenies
- Unifying Zero-Knowledge Proofs of Knowledge
- Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
- Public Key Cryptography – PKC 2004
- A new framework for the design and analysis of identity-based identification schemes
- New receipt-free voting scheme using double-trapdoor commitment
- Improved low-computation partially blind signatures.
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
- Logarithmic-size ring signatures with tight security from the DDH assumption
- Security proofs for identity-based identification and signature schemes
- On the unlinkability of randomization-enhanced Chaum's blind signature scheme
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages
- Optimal security proofs for signatures from identification schemes
- Short signatures from Diffie-Hellman: realizing almost compact public key
- A fair and efficient solution to the socialist millionaires' problem
- Efficient non-malleable commitment schemes
- From Identification to Signatures, Tightly: A Framework and Generic Transforms
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Efficient set operations in the presence of malicious adversaries
- Fiat-Shamir for highly sound protocols is instantiable
- Equivocal Blind Signatures and Adaptive UC-Security
- Fiat-Shamir for highly sound protocols is instantiable
- Hash Functions from Sigma Protocols and Improvements to VSH
- Delegating a product of group exponentiations with application to signature schemes
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Title not available (Why is that?)
- Simple Schnorr multi-signatures with applications to bitcoin
- Accountable authority key policy attribute-based encryption
- Title not available (Why is that?)
- Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
- Does Fiat-Shamir require a cryptographic hash function?
- From Identification to Signatures Via the Fiat–Shamir Transform: Necessary and Sufficient Conditions for Security and Forward-Security
- On the security of a practical identification scheme
- Title not available (Why is that?)
- Cryptographic reverse firewalls for interactive proof systems
- Secure electronic bills of lading: Blind counts and digital signatures
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Zero-knowledge proofs of knowledge for group homomorphisms
- Title not available (Why is that?)
- Provably Secure Identity Based Provable Data Possession
- Title not available (Why is that?)
- New generation of secure and practical RSA-based signatures
- Leakage-resilient signatures
- One-time signatures and chameleon hash functions
- Signatures from sequential-OR proofs
- Lattice-based blind signatures, revisited
- Lower bounds for non-black-box zero knowledge
- Two-party adaptor signatures from identification schemes
- Improving the exact security of digital signature schemes
- On the security of a practical identification scheme
- Security of \(2^t\)-root identification and signatures
- \(k\)-critical graphs in \(P_5\)-free graphs
- Proxy blind multi-signature scheme without a secure channel
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- Interactive Bi-Proof Systems and Undeniable Signature Schemes
- Efficient identification and signature schemes
- Bounded tamper resilience: how to go beyond the algebraic barrier
- A correction to a code-based blind signature scheme
- Anonymous tokens with private metadata bit
- Efficient non-malleable commitment schemes
- Several practical protocols for authentication and key exchange
- Title not available (Why is that?)
- Sigma protocols from verifiable secret sharing and their applications
- Converting normal DLP-based signatures into blind
- Anamorphic signatures: secrecy from a dictator who only permits authentication!
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Real Hidden Identity-Based Signatures
- Title not available (Why is that?)
- A rational threshold signature model and protocol based on different permissions
- Leakage resilience of the Blom's key distribution scheme
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols
- Rogue-instance security for batch knowledge proofs
- Off-line electronic cash based on secret-key certificates
- Endemic oblivious transfer via random oracles, revisited
- Improved straight-line extraction in the random oracle model with applications to signature aggregation
- A provable secure pairing-free certificateless identification scheme
- Snowblind: a threshold blind signature in pairing-free groups
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes
- \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
- Identity-based signature scheme secure in ephemeral setup and leakage scenarios
- Digital signatures
- Rai-Choo! Evolving blind signatures to the next level
- Threshold and multi-signature schemes from linear hash functions
- PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more
- Pairing-free blind signatures from standard assumptions in the ROM
- Sherlock Holmes zero-knowledge protocols
- On pairing-free blind signature schemes in the algebraic group model
- Oblivious issuance of proofs
- Leakage-resilient identification schemes from zero-knowledge proofs of storage
- Efficient schemes for anonymous yet authorized and bounded use of cloud resources
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Toward tight security of the Galindo-Garcia identity-based signature
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4318686)
