Cryptography in an Unbounded Computational Model

Authors:
David P. Woodruff;Marten van Dijk
Affiliations:
-;-
Venue:
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Year:
2002

Citing 1
Cited 2

One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Securing services in nomadic computing environments

Information and Software Technology
Some transfinite generalisations of gödel's incompleteness theorem

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the possibility of cryptographic primitives over nonclassical computational models. We replace the traditional finite field Fn* 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.