Errors in Computational Complexity Proofs for Protocols

Lecture Notes in Computer Science - Germany
doi 10.1007/11593447_34
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Computationally Sound Mechanized Proofs for Deniable Authentication Protocols With a Probabilistic Polynomial Calculus in Computational Model

Information Technology Journal
2011English

Modular Security Proofs for Key Agreement Protocols

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

A Complexity Tradeoff in Ranking-Function Termination Proofs

Acta Informatica
Computer NetworksSoftwareInformation SystemsCommunications
2008English

Computational Complexity and Knowledge Complexity

SIAM Journal on Computing
MathematicsComputer Science
1998English

Complexity in Automation of SOS Proofs: An Illustrative Example

2006English

On the Concrete Complexity of Zero-Knowledge Proofs

English

Uncertainty and Computational Complexity

Philosophical Transactions of the Royal Society B: Biological Sciences
BiochemistryAgriculturalGeneticsMolecular BiologyBiological Sciences
2018English

Entropy as Computational Complexity

Journal of Information Processing
2010English

Descriptive and Computational Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy