Efficient Probabilistic Public-Key Encryption Scheme

Efficient Probabilistic Public-Key Encryption Scheme

EPOC (Efficient Probabilistic Public Key Encryption) is a probabilistic public-key encryption scheme.

EPOC was developed in 1999 by T. Okamoto, S. Uchiyama and E. Fujisaki of NTT Labs in Japan. It is based on the random oracle model, in which a primitive public-key encryption function is converted to a secure encryption scheme by use of a truly random hash function; the resulting scheme is designed to be semantically secure against a chosen ciphertext attack.

EPOC's primitive encryption function is the OU (Okamoto-Uchiyama) function, in which to invert the OU function is proven to be as hard as factoring a composite integer public-key. There are three versions of EPOC:

* EPOC-1 uses a one-way trapdoor function and a random function (hash function);

* EPOC-2 uses a one-way trapdoor function, two random functions (hash functions) and a symmetric-key encryption (e.g., one-time padding and block-ciphers);

* EPOC-3 uses the Okamoto-Uchiyama one-way trapdoor function and two random functions (hash functions) as well as any symmetric encryption scheme such as the one-time pad, or any classical block-cipher.

EPOC-1 is designed for key-distribution; EPOC-2 and EPOC-3 are designed for both key-distribution and encrypted data transfer.

See also

* Cryptography
* Computational complexity theory
* Okamoto-Uchiyama cryptosystem

References

* T. Okamoto, S. Uchiyama and E. Fujisaki (1999). " [http://grouper.ieee.org/groups/1363//StudyGroup/NewFam.html#OUF EPOC: Efficient Probabilistic Public-Key Encryption] ", Contribution to IEEE - describes EPOC-1 and EPOC-2.
* T. Okamoto and D. Pointcheval (2000). " [http://grouper.ieee.org/groups/1363//StudyGroup/NewFam.html#epoc3 EPOC-3: Efficient Probabilistic Public-Key Encryption (Version 2)] ", Contribution to IEEE - describes EPOC-3.
*

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Probabilistic encryption — is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term probabilistic encryption is typically used in reference to public key… …   Wikipedia

  • Blum-Goldwasser cryptosystem — The Blum Goldwasser (BG) cryptosystem is an asymmetric key encryption algorithm proposed by Manuel Blum and Shafi Goldwasser in 1984. Blum Goldwasser is a probabilistic, semantically secure cryptosystem with a constant size ciphertext expansion.… …   Wikipedia

  • Deterministic encryption — A deterministic encryption scheme (as opposed to a probabilistic encryption scheme) is a cryptosystem which always produces the same ciphertext for a given plaintext and key, even over separate executions of the encryption algorithm. Examples of… …   Wikipedia

  • Multiple channel cryptography — Infobox block cipher name = MCC designers = Richard Ervasti publish date = 2008 ndash;02 key size = variable block size = variable structure = SPN rounds = 2 cryptanalysis = Multiple channel cryptography (MCC) is an emerging approach to block… …   Wikipedia

  • EPOC — may be:* Excess post exercise oxygen consumption * Emotiv#Emotiv EPOC Emotiv Epoc peripheral for gaming on Windows PCs. * EPOC (computing), the precursor to the Symbian operating system * Efficient Probabilistic Public Key Encryption Scheme …   Wikipedia

  • EPOC (disambiguation) — EPOC may be:* Emotiv#Emotiv EPOC Emotiv Epoc peripheral for gaming on Windows PCs. * EPOC (computing), the precursor to the Symbian operating system * Excess post exercise oxygen consumption * Efficient Probabilistic Public Key Encryption Scheme …   Wikipedia

  • Cryptosysteme de Blum-Goldwasser — Cryptosystème de Blum Goldwasser Le cryptosystème de Blum Goldwasser (BG) est un algorithme de chiffrement asymétrique proposé par Manuel Blum et Shafi Goldwasser en 1984. Blum Goldwasser est un cryptosystème probabilistique et sémantiquement sûr …   Wikipédia en Français

  • Cryptosystème De Blum-Goldwasser — Le cryptosystème de Blum Goldwasser (BG) est un algorithme de chiffrement asymétrique proposé par Manuel Blum et Shafi Goldwasser en 1984. Blum Goldwasser est un cryptosystème probabilistique et sémantiquement sûr avec une augmentation de taille… …   Wikipédia en Français

  • Cryptosystème de Blum-Goldwasser — Le cryptosystème de Blum Goldwasser (BG) est un algorithme de chiffrement asymétrique proposé par Manuel Blum et Shafi Goldwasser en 1984. Blum Goldwasser est un cryptosystème probabilistique et sémantiquement sûr avec une augmentation de taille… …   Wikipédia en Français

  • Cryptosystème de blum-goldwasser — Le cryptosystème de Blum Goldwasser (BG) est un algorithme de chiffrement asymétrique proposé par Manuel Blum et Shafi Goldwasser en 1984. Blum Goldwasser est un cryptosystème probabilistique et sémantiquement sûr avec une augmentation de taille… …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”