Cryptography in an unbounded computational model

D.P. Woodruff, M. Van Dijk

Research output: Chapter in Book / Report / Conference proceedingConference contributionAcademicpeer-review

Abstract

© 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.
Original languageEnglish
Title of host publicationAdvances in Cryptology - EUROCRYPT 2002 - International Conference on the Theory and Applications of Cryptographic Techniques, 2002, Proceedings
EditorsL.R. Knudsen
PublisherSpringer Verlag
Pages149-164
ISBN (Print)9783540435532
DOIs
Publication statusPublished - 2002
Externally publishedYes
EventInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002 - Amsterdam, Netherlands
Duration: 28 Apr 20022 May 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2002
Country/TerritoryNetherlands
CityAmsterdam
Period28/04/022/05/02

Fingerprint

Dive into the research topics of 'Cryptography in an unbounded computational model'. Together they form a unique fingerprint.

Cite this