On Higher-Order Cryptography - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

On Higher-Order Cryptography


Type-two constructions abound in cryptography: adversaries for encryption and authentication schemes, if active, are modeled as algorithms having access to oracles, i.e. as second-order algorithms. But how about making cryptographic schemes themselves higher-order? This paper gives an answer to this question, by first describing why higher-order cryptography is interesting as an object of study, then showing how the concept of probabilistic polynomial time algorithm can be generalized so as to encompass algorithms of order strictly higher than two, and finally proving some positive and negative results about the existence of higher-order cryptographic primitives, namely authentication schemes and pseudorandom functions.
Fichier principal
Vignette du fichier
icalp2020.pdf (640.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03120781 , version 1 (25-01-2021)



Boaz Barak, Raphaëlle Crubillé, Ugo Dal Lago. On Higher-Order Cryptography. ICALP 2020 - 47th International Colloquium on Automata, Languages, and Programming, Jul 2020, Saarbrucken, Germany. ⟨10.4230/LIPIcs.ICALP.2020.108⟩. ⟨hal-03120781⟩
55 View
141 Download



Gmail Facebook X LinkedIn More