Private Information Retrieval Based on the Subgroup Membership Problem
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Cryptanalysis of Two Cryptosystems Based on Group Actions
ASIACRYPT '99 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Designs, Codes and Cryptography
A new cramer-shoup like methodology for group based provably secure encryption schemes
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Hi-index | 0.00 |
The public key cryptosystems MST1 and MST2 make use of certain kinds of factorizations of finite groups. We show that generalizing such factorizations to infinite groups allows a uniform description of several proposed cryptographic primitives. In particular, a generalization of MST2 can be regarded as a unifying framework for several suggested cryptosystems including the ElGamal public key system, a public key system based on braid groups, and the MOR cryptosystem.