@inproceedings{e63d5cf11e97464d9e20f9b33b4dbfa0,
title = "Cryptography in an unbounded computational model",
abstract = "{\textcopyright} Springer-Verlag Berlin Heidelberg 2002.We investigate the possibility of cryptographic primitives over nonclassical computational models. We replace the traditional finite field F*n with the infinite field Q of rational numbers, and we give all parties unbounded computational power. We also give parties the ability to sample random real numbers. We determine that secure signature schemes and secure encryption schemes do not exist.We then prove more generally that it is impossible for two parties to agree upon a shared secret in this model. This rules out many other cryptographic primitives, such as Diffie-Hellman key exchange, oblivious transfer and interactive encryption.",
author = "D.P. Woodruff and {Van Dijk}, M.",
year = "2002",
doi = "10.1007/3-540-46035-7_10",
language = "English",
isbn = "9783540435532",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "149--164",
editor = "L.R. Knudsen",
booktitle = "Advances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings",
note = "International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002 ; Conference date: 28-04-2002 Through 02-05-2002",
}