Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

@inproceedings{Okamoto1992ProvablySA,
  title={Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes},
  author={Tatsuaki Okamoto},
  booktitle={CRYPTO},
  year={1992}
}
  • T. Okamoto
  • Published in CRYPTO 16 August 1992
  • Mathematics, Computer Science
This paper presents a three-move interactive identification scheme and proves it to be as secure as the discrete logarithm problem. This provably secure scheme is almost as efficient as the Schnorr identification scheme, while the Schnorr scheme is not provably secure. This paper also presents another practical identification scheme which is proven to be as secure as the factoring problem and is almost as efficient as the Guillou-Quisquater identification scheme: the Guillou-Quisquater scheme… Expand
Practical Identification Schemes as Secure as the DL and RSA problems ( Submission to P 1363 a )
We present a practical three-move interactive identification scheme, ID-DL, and prove it to be as secure as the discrete logarithm problem. ID-DL is almost as efficient as the Schnorr identificationExpand
A Pairing-Free Identity-Based Identification Scheme with Tight Security Using Modified-Schnorr Signatures
TLDR
This work proposes an identity-based identification (IBI) scheme with tight security based on a variant of the Schnorr signature scheme known as TNC signatures that enjoys shorter parameters and key sizes as compared to existing IBI schemes without increasing the number of operations required for its identification protocol. Expand
Identity based identification from algebraic coding theory
TLDR
This paper revisits an existing code-based IBI scheme which is derived by combining the Courtois-Finiasz-Sendrier signature scheme and the Stern zero-knowledge identification scheme and proves that the scheme in fact can resist active attacks. Expand
A Framework for Efficient Signatures, Ring Signatures and Identity Based Encryption in the Standard Model
TLDR
This work shows a transformation taking a signature scheme with a very weak security guarantee and producing a fully secure signature scheme, and shows that ring trapdoor functions imply ring signatures under a weak definition, which enables the transformation to achieve full security. Expand
New Generation of Secure and Practical RSA-Based Signatures
TLDR
Under an appropriate assumption about RSA, the scheme is proven to be not existentially forgeable under adaptively chosen message attacks and presented a digital signature that offers both proven security and practical value. Expand
A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption
TLDR
This paper investigates the key exposure problem in blind signature (with an application to the electronic cash in mind) and proposes a blind signature scheme which guarantees forward secrecy and shows the equivalence between the existence of a forger with the solvability of the strong RSA problem. Expand
A New Blind Identity-Based Signature Scheme with Message Recovery
TLDR
A new blind identity-based signature scheme with message recovery based on bilinear pairings on elliptic curves is presented, which eliminates the certificates for public keys needed in traditional public key cryptosystems and achieves bandwidth savings. Expand
RSA Based Digital Signature for Secure Authentication
Now these days, many technical concepts and tools have been developed in the cryptographic field. Most digital signature schemes used in practice, such as RSA or DSA, have an important role inExpand
On the Linkability and Security Analysis of Two Schnorr-Type Blind Signature Schemes
TLDR
The corresponding attack on the two blind signature schemes is given and the reasons to produce such attack are analyzed, then an improved blind signature scheme is given. Expand
A More Natural Way to Construct Identity-Based Identification Schemes
TLDR
This paper proposes a simple and efficient framework for constructing identity-based identification schemes, and defines a new notion for proof systems called Witness Dualism, which is weaker than that of witness indistinguishable and shows that it is enough for constructing an IBI scheme secure against the most powerful type of adversaries defined. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 39 REFERENCES
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
TLDR
A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message. Expand
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
TLDR
A modification of an interactive identification scheme of Schnorr intended for use by smart cards is described, which will be witness hiding, which is a more rigid security condition than Schnorr proved for his scheme, if factoring a large integer with some side information is computationally infeasible. Expand
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two importantExpand
Identity-Based Cryptosystems and Signature Schemes
TLDR
A novel type of cryptographic scheme, which enables any pair of users to communicate securely and to verify each other’s signatures without exchanging private or public keys, without keeping key directories, and without using the services of a third party. Expand
A Modification of the Fiat-Shamir Scheme
TLDR
This paper proposes an identification and signature scheme based on the difficulty of extracting the L-th roots mod n when the factors of n are unknown and proves that the sequential version of this scheme is a zero knowledge interactive proof system and the parallel version satisfies variations of no transferable information under some conditions. Expand
A single public-key authentication scheme for multiple users
  • T. Okamoto
  • Computer Science
  • Systems and Computers in Japan
  • 1987
TLDR
A digital signature system, where the authentication of a large number of users can be performed by a single public-key, which appears to be equivalent to that of RSA or the digital signature based on RSA. Expand
Interactive identification and digital signatures
TLDR
An interactive identification scheme discovered at Sandia National Laboratories in which the security is based on the computational difficulty of solving two hard problems is described. Expand
A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme
TLDR
The following properties are proven; the difficulty of deriving secret information from public information in a multisignature scheme with already used signatures is equivalent to that ofDeriving it in a single signature scheme in the Fiat-Shamir scheme. Expand
Security Bounds for Parallel Versions of Identification Protocols (Extended Abstract)
TLDR
The security bounds defined in this paper is an universal security measure for parallel versions of identification protocols and discusses the generalized Fiat-Shamir identification scheme ID(L,k,t,n) which is defined in [CDL]. Expand
How to Prove Yourself: Practical Solutions to Identification and Signature Problems
TLDR
Simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys are described. Expand
...
1
2
3
4
...