Public Key Cryptography

@inproceedings{Goos1999PublicKC,
  title={Public Key Cryptography},
  author={Gerhard Goos and Juris Hartmanis and Jan van Leeuwen},
  booktitle={Lecture Notes in Computer Science},
  year={1999}
}
The magic ink signature recently proposed in [11] is a blind signature which allows “unblinding” of a signature by authorities to establish what is known as audit trail and anonymity revocation in case of criminal activities. In [11] as well as in all the previous fair blind signature schemes (e. g., [2] and [10]), trustees need to search a database maintained by signers to obtain a transcript of the corresponding signing protocol instance in order to trace the signature receiver. In other… 
1 Citations
Linear Corrector Overcoming Minimum Distance Limitation for Secure TRNG from (17, 9, 5) Quadratic Residue Code
A true random number generator (TRNG) is widely used to generate secure random numbers for encryption, digital signatures, authentication, and so on in crypto-systems. Since TRNG is vulnerable to

References

SHOWING 1-10 OF 23 REFERENCES
Fair Blind Signatures
TLDR
A new type of blind signature schemes called fairblind signature schemes is proposed, which have the additional property that a trusted entity can deliver information allowing the signer to link his view of the protocol and the message-signature pair.
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 important
Efficient scalable fair cash with off-line extortion prevention
TLDR
This paper proposes a new efficient fair cash system which offers scalable security with respect to its efficiency and prevents extortion attacks, like blackmailing or the use of blindfolding protocols under off-line payments and with the involvement of the trustee only at registration of the users.
On blind signatures and perfect crimes
TLDR
A problematic aspect of blind signatures is discussed, showing that this perfect solution to protect the identity and privacy of a user can potentially lead to perfect crime.
Optimistic fair exchange of digital signatures
We present a new protocol that allows two players to exchange digital signatures over the Internet in a fair way, so that either each player gets the other's signature, or neither player does. The
Fair cryptosystems
There is a growing concern that the wide use of encryption may be more dangerous than helpful to society. In particular, good encryption schemes make court-authorized line-tapping, an effective tool
Meta-Message Recovery and Meta-Blind Signature Schemes Based on the Discrete Logarithm Problem and Their Applications
TLDR
This paper presents the Meta-blind signature schemes which have been developed from the ElGamal based blind signature scheme and the message recoveryblind signature scheme discovered recently, and extracts various variants from which some are more efficient than the already known ones.
Trustee-based tracing extensions to anonymous cash and the making of anonymous change
TLDR
This work introduces the first electronic cash systems which incorporate trustee-based tracing but otherwise provably protect user anonymity, and expands on the provably anonymous electronic cash svstems of TB931 and lFY921.
Publicly Verifiable Secret Sharing
TLDR
Publicly verifiable secret sharing schemes are called, new applications to escrow cryptosystems and to payment systems with revocable anonymity are discussed, and two new realizations based on ElGamal's Cryptosystem are presented.
Meta-Multisignature schemes based on the discrete logarithm problem
In this paper we present the first multisignature scheme giving message recovery based on the discrete logarithm problem. An efficient multisignature scheme with appendix has been proposed by Harn
...
1
2
3
...