On using probabilistic Turing machines to model participants in cryptographic protocols

DOI10.1016/J.TCS.2013.05.015zbMath1296.68050OpenAlexW2019004890WikidataQ62038920 ScholiaQ62038920MaRDI QIDQ391316

Rainer Steinwandt, Lee Klingler, Dominique Unruh

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.015

zbMATH Keywords

provable securitycryptographic protocol\(\mathbb Z\)-algebraprobabilistic Turing machine

Mathematics Subject Classification ID

Cryptography (94A60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Foundations of Cryptography
• Quantum Complexity Theory
• Probabilistic Turing Machines and Computability

This page was built for publication: On using probabilistic Turing machines to model participants in cryptographic protocols