Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
A robust and verifiable cryptographically secure election scheme
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A Multi-party Optimistic Non-repudiation Protocol
ICISC '00 Proceedings of the Third International Conference on Information Security and Cryptology
A Cryptographic Scheme for Computerized Elections
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
A multisignature scheme based on the SDLP and on the IFP
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Algebraic Framework for the Specification and Analysis of Cryptographic-Key Distribution
Fundamenta Informaticae
A generic algebraic model for the analysis of cryptographic-key assignment schemes
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
| Hi-index | 0.00 |
This paper describes an implementation of a cipher system with any number of keys which is a generalisation of the RSA cryptosystem. Three applications of such a cipher system are given. The general properties required for possible alternative implementations are discussed.