The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Secure communications over insecure channels
Communications of the ACM
Riemann's Hypothesis and tests for primality
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
ACM SIGSAM Bulletin
The longtime behavior of solutions to a quasilinear combustion model
Nonlinear Analysis: Theory, Methods & Applications
The KryptoKnight family of light-weight protocols for authentication and key distribution
IEEE/ACM Transactions on Networking (TON)
Securing Agent Based Architectures
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Systematic Design of Two-Party Authentication Protocols
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
ICCC '02 Proceedings of the 15th international conference on Computer communication
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Transformations of two cryptographic problems in terms of matrices
ACM SIGSAM Bulletin
Load-balanced key establishment methodologies in wireless sensor networks
International Journal of Security and Networks
A tree-based scheme for security of many-to-many communications
Journal of High Speed Networks - Broadband Multimedia Sensor Networks in Healthcare Applications
On anonymity in an electronic society: A survey of anonymous communication systems
ACM Computing Surveys (CSUR)
Attacks on protocols for server-aided RSA computation
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Structures for communication-efficient public key revocation in ubiquitous sensor network
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
A lightweight group-key management protocol for secure ad-hoc-network routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Heuristics for minimum brauer chain problem
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Privacy enhanced technologies: methods – markets – misuse
TrustBus'05 Proceedings of the Second international conference on Trust, Privacy, and Security in Digital Business
Identity based ring signature: why, how and what next
EuroPKI'05 Proceedings of the Second European conference on Public Key Infrastructure
Linking ad hoc charging schemes to AAAC architectures
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Identity based threshold ring signature
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
BSCA-P: privacy preserving coalition formation
MATES'05 Proceedings of the Third German conference on Multiagent System Technologies
Byzantine fault-tolerance with commutative commands
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Securing cloud-based computations against malicious providers
ACM SIGOPS Operating Systems Review
An efficient IND-CCA2 secure variant of the niederreiter encryption scheme in the standard model
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Securing cloud-based computations against malicious providers
Proceedings of the 1st European Workshop on Dependable Cloud Computing
Efficient autonomous signature exchange on ubiquitous networks
Journal of Network and Computer Applications
Parallelization of Pollard's Rho Integer factorization algorithm
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Resource-efficient authentic key establishment in heterogeneous wireless sensor networks
Journal of Parallel and Distributed Computing
Robustness in the Salus scalable block store
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Hi-index | 0.00 |
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:Couriers or other secure means are not needed to transmit keys, since a message can 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.A message can be “signed” using a privately held decryption key. Anyone can verify this signature using the corresponding publicly revealed encryption key. Signatures cannot be forged, and a signer cannot later deny the validity of his signature. This has obvious applications in “electronic mail” and “electronic funds transfer” systems. A message is encrypted by representing it as a number M, raising M to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q. Decryption is similar; only a different, secret, power d is used, where e * d = 1(mod (p - 1) * (q - 1)). The security of the system rests in part on the difficulty of factoring the published divisor, n.