On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits

DOI10.1007/978-3-540-70936-7_10zbMath1129.94022OpenAlexW1808994368MaRDI QIDQ3596379

Oded Goldreich

Publication date: 30 August 2007

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70936-7_10

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (3)

Polynomial runtime and composability ⋮ On using probabilistic Turing machines to model participants in cryptographic protocols ⋮ Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs

This page was built for publication: On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits