Decision oracles are equivalent to matching oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1560, Issue , 1999, Pages 276-289

  Handschuh, Helena ^a   Tsiounis, Yiannis ^b   Yung, Moti ^c  

^a TELECOM PARISTECH   (France)

^b VERIZON   (United States)

^c CertCo   (United States)

Author keywords

Decision problems; Diffie Hellman variants; Homomorphic encryption functions (El Gamal, Goldwasser Micali, Okamoto Uchiyama, Naccache Stern); Matching problems; Public key encryption; Random self reducibility; Randomized reductions; Uniform reductions; Universal malleability

Indexed keywords

CHROMIUM COMPOUNDS; EQUIVALENCE CLASSES; SEMANTICS;

DECISION PROBLEMS; DIFFIE HELLMAN; MATCHING PROBLEMS; OKAMOTO; PUBLIC-KEY ENCRYPTION; RANDOM SELF-REDUCIBILITY; RANDOMIZED REDUCTIONS; UNIFORM REDUCTION; UNIVERSAL MALLEABILITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84956868340     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49162-7_22     Document Type: Conference Paper

References (14)

1. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information. In B. Kaliski, editor, Advances in Cryptology - CRYPTO ’97 Proceedings, LLNCS 1294, pages 455-469, Santa Barbara, CA, August 17-21 1997. Springer-Verlag.
2. A. Chan, Y. Frankel, and Y. Tsiounis. Easy come-easy go divisible cash. In Advances in Cryptology - Proceedings of Eurocrypt ‘98 (Lecture Notesin Computer Science 1403), pages 561-575, Helsinki, Finland, May 31-June 4 1998. Springer-Verlag. International patent pending. Available at http://www.ccs.neu.edu/home/yiannis/pubs.html.
3. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Advances in Cryptology: Crypto ‘98, Proceedings (Lecture Notes in Computer Science 1462), pages 13-25, 1998. Available at http://www.cs.wisc.edu/shoup/papers/.
4. I. B. Damgard. Towards practical public key systems against chosen ciphertext attacks. In J. Feigenbaum, editor, Advances in Cryptology, Proc. of Crypto ‘91 (Lecture Notes in Computer Science 576), pages 445-456. Springer-Verlag, 1991.
5. O. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. In Proceedings of the 23rd Annual Symposium on Theory of Computing, 1991.
6. T. ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inform. Theory, 31:469-472, 1985.
7. Frankel, Y. Tsiounis, and M. Yung. Indirect discourse proofs: achieving fair off-line e-cash. In Advances in Cryptology, Proc. of Asiacrypt ‘96 (Lecture Notes in Computer Science 1163), pages 286-300, Kyongju, South Korea, November 3-7 1996. Springer-Verlag. International patent pending. Available at http://www.ccs.neu.edu/home/yiannis/pubs.html.
8. Y. Frankel, Y. Tsiounis, and M. Yung. Fair off-line cash made easy. In Advances in Cryptology, Proc. of Asiacrypt ‘98 (Lecture Notes in Computer Science). Springer-Verlag, October 18-22 1998. To appear. Available at http://www.ccs.neu.edu/home/yiannis/pubs.html.
9. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, April 1984.
10. O. Goldreich. A uniform-complexity treatment of encryption and zero-knowledge. Journal of Cryptology, 6(1):21-53, 1993.
11. D. Naccache and J. Stern. A new cryptosystem based on higher residues. In ACM CCS ‘98-Communications and Computer Security, 1998. To appear.
12. T. Okamoto. An efficient divisible electronic cash scheme. In Don Coppersmith, editor, Advances in Cryptology, Proc. of Crypto ‘95 (Lecture Notes in Computer Science 963), pages 438-451. Springer-Verlag, 1995.
13. T. Okamoto and S. Uchiyama. An efficient public-key cryptosystem. In Advances in Cryptology - Eurocrypt 98 proceedings (Lecture Notes in Computer Science 1403), pages 308-318, Espoo, Finland, 1998. Springer-Verlag.
14. Y. Tsiounis and M. Yung. On the security of El Gamal-based encryption. In International workshop on Public Key Cryptography (PKC ’98) (Lecture Notes in Computer Science 1431), pages 117-134, Yokohama, Japan, February 5-6 1998. Springer-Verlag. Available at http://yiannis.home.ml.org.