A user authentication scheme not requiring secrecy in the computer
Communications of the ACM
A high security log-in procedure
Communications of the ACM
Secret Handshakes from Pairing-Based Key Agreements
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
A note on efficient implementation of prime generation algorithms in small portable devices
Computer Networks: The International Journal of Computer and Telecommunications Networking
Key establishment for layered group-based Wireless Sensor Networks
International Journal of Ad Hoc and Ubiquitous Computing
A formal approach to security architectures
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secret signatures: how to achieve business privacy efficiently?
WISA'07 Proceedings of the 8th international conference on Information security applications
Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
On the power of non-spoofing adversaries
DISC'10 Proceedings of the 24th international conference on Distributed computing
Functional encryption: definitions and challenges
TCC'11 Proceedings of the 8th conference on Theory of cryptography
A simple group diffie-hellman key agreement protocol without member serialization
CIS'04 Proceedings of the First international conference on Computational and Information Science
How to authenticate real time streams using improved online/offline signatures
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
Functional encryption: a new vision for public-key cryptography
Communications of the ACM
A new tool for sharing and querying of clinical documents modeled using HL7 Version 3 standard
Computer Methods and Programs in Biomedicine
| Hi-index | 0.02 |
This paper deals with new problems which arise in the application of cryptography to computer communication systems with large numbers of users. Foremost among these is the key distribution problem. We suggest two techniques for dealing with this problem. The first employs current technology and requires subversion of several separate key distribution nodes to compromise the system's security. Its disadvantage is a high overhead for single message connections. The second technique is still in the conceptual phase, but promises to eliminate completely the need for a secure key distribution channel, by making the sender's keying information public. It is also shown how such a public key cryptosystem would allow the development of an authentication system which generates an unforgeable, message dependent digital signature.