A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Liability and Computer Security: Nine Principles
ESORICS '94 Proceedings of the Third European Symposium on Research in Computer Security
HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
Multiuser cryptographic techniques
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Quantum resistant public key cryptography: a survey
Proceedings of the 8th Symposium on Identity and Trust on the Internet
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Hi-index | 0.00 |
In this paper we outline (apparently) the first globally scalable, post quantum secure, symmetric method of Identity Management (IdM) and Cryptographic Key Management (CKM) that is secure against a collusion of up to m-1 participating service providers. Our proposal is made in response to the U.S. National Institute of Standards and Technology (NIST) 2009 call [4] for new high-availability IdM/CKM designs that do NOT use public key technologies. Our efficiently realisable proposal addresses this and many other requirements identified by NIST managers.