• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,192
Next 10 →

A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

by Shafi Goldwasser, Silvio Micali, Ronald L. Rivest , 1995
"... We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be chosen in a ..."
Abstract - Cited by 959 (40 self) - Add to MetaCart
We present a digital signature scheme based on the computational diculty of integer factorization. The scheme possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice (where each message may be chosen

Optimistic fair exchange of digital signatures

by N. Asokan, Victor Shoup, Michael Waidner - IEEE Journal on Selected Areas in Communications , 1998
"... Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example, an elect ..."
Abstract - Cited by 290 (10 self) - Add to MetaCart
Abstract. We present a new protocol that allows two players to ex-change digital signatures over the Internet in a fair way, so that either each player gets the other’s signature, or neither player does. The ob-vious application is where the signatures represent items of value, for example

Security Arguments for Digital Signatures and Blind Signatures

by David Pointcheval, Jacques Stern - JOURNAL OF CRYPTOLOGY , 2000
"... Since the appearance of public-key cryptography in the seminal Diffie-Hellman paper, many new schemes have been proposed and many have been broken. Thus, the ..."
Abstract - Cited by 375 (39 self) - Add to MetaCart
Since the appearance of public-key cryptography in the seminal Diffie-Hellman paper, many new schemes have been proposed and many have been broken. Thus, the

A method for obtaining digital signatures and public-key cryptosystems.

by R L Rivest , A Shamir , L Adleman - Communications of the ACM, , 1978
"... Abstract 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 consequences: 1. Couriers or other secure means are not needed to transmit keys, since a message can be encip ..."
Abstract - Cited by 3894 (24 self) - Add to MetaCart
be enciphered using an encryption key publicly revealed by the intended recipient. Only he can decipher the message, since only he knows the corresponding decryption key. 2. A message can be "signed" using a privately held decryption key. Anyone can verify this signature using the corresponding

Digital Signatures for Flows and Multicasts

by Chung Kei Wong, Simon S. Lam , 1999
"... We present chaining techniques for signing/verifying multiple packets using a single signing/verification operation. We then present flow signing and verification procedures based upon a tree chaining technique. Since a single signing/verification operation is amortized over many packets, these proc ..."
Abstract - Cited by 169 (2 self) - Add to MetaCart
applications. To further improve our procedures, we propose several extensions to the Feige-Fiat-Shamir digital signature scheme to substantially speed up both the signing and verification operations, as well as to allow “adjustable and incremental ” verification. The extended scheme, called eFFS, is compared

digital signature into an

by Joan Puate, Fred Jordan
"... fractal compression scheme to embed a ..."
Abstract - Add to MetaCart
fractal compression scheme to embed a

On the validity of digital signatures

by Jianying Zhou, Robert Deng - Computer Communication Review , 2000
"... An important feature of digital signatures is to serve as nonrepudiation evidence. To be eligible as non-repudiation evidence, a digital signature on an electronic document should remain valid until its expiry date which is speci ed by some non-repudiation policy. As signature keys may be compromise ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
An important feature of digital signatures is to serve as nonrepudiation evidence. To be eligible as non-repudiation evidence, a digital signature on an electronic document should remain valid until its expiry date which is speci ed by some non-repudiation policy. As signature keys may

Digital Signature Schemes

by Nick Carruthers , 1997
"... Abstract: This thesis will attempt to describe in detail the concepts of digital signatures and the related background issues. We will begin with a general introduction to cryptography and digital signatures and follow with an overview of the requisite math involved in cryptographic applications. We ..."
Abstract - Add to MetaCart
Abstract: This thesis will attempt to describe in detail the concepts of digital signatures and the related background issues. We will begin with a general introduction to cryptography and digital signatures and follow with an overview of the requisite math involved in cryptographic applications

Easing PAIN with Digital Signatures

by M. Tariq Banday
"... Different forms of encryption techniques are being used to ensure privacy of data transmitted over Internet. Digital signature which uses Public Key Encryption (PKE) ensures privacy of conversation, integrity of data, authenticity of sender and non-repudiation of sender. Several applications on desk ..."
Abstract - Add to MetaCart
Different forms of encryption techniques are being used to ensure privacy of data transmitted over Internet. Digital signature which uses Public Key Encryption (PKE) ensures privacy of conversation, integrity of data, authenticity of sender and non-repudiation of sender. Several applications

The exact security of digital signatures -- How to sign with RSA and Rabin

by Mihir Bellare, Phillip Rogaway , 1996
"... We describe an RSA-based signing scheme called PSS which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing, ..."
Abstract - Cited by 386 (17 self) - Add to MetaCart
We describe an RSA-based signing scheme called PSS which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing,
Next 10 →
Results 1 - 10 of 3,192
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University