Generalized Public Key Transformations with Side Information
This work addresses cryptographic security challenges for secure communication protocols, though it appears incremental as it builds on existing public key concepts.
The paper tackles the problem of constructing generalized public key transformations that are not one-to-one, achieving uniqueness through side information, with applications in oblivious transfer and generating specific probability events.
This paper presents results on generalized public key cryptography with exponentials modulo primes and composite numbers where the mapping is not one-to-one and the uniqueness is achieved by additional side information. Such transformations may be used for oblivious transfer and generate events of specific probabilities.