Ambiguous Asymmetric Schemes

This paper presents three different schemes, two of which protect against private key exposure in asymmetric primitives. We extend "Ambiguous Multi-Symmetric Cryptography" (AMSC) to public key cryptography and analyze security and performance. Two of the schemes allow the receiver to have plausible deniability if compelled to give up their private asymmetric keys as a tool for deniable encryption. The third scheme can be used to distribute messages to n receivers using one cipher. All schemes strengthen asymmetric primitives in general and provide security beyond conventional brute-force bounds. In particular, we test one scheme and find that it is faster than RSA when sending n plain-texts in both encryption and decryption, but it is slower in initialization.