Computational Soundness of Formal Indistinguishability and Static Equivalence

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-77505-8_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Formal Equivalence Analysis

2019English

Formal Indistinguishability Extended to the Random Oracle Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Soundness of Formal Encryption in the Presence of Active Adversaries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Computational Complexity of Formal Translations

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1974English

Reducing Equational Theories for the Decision of Static Equivalence

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2010English

Reducing Equational Theories for the Decision of Static Equivalence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Formal Equivalence of the Nonlinear String and One-Dimensional Fluid Flow

Quarterly of Applied Mathematics
Applied Mathematics
1965English

A Formal Computational Semantics and Pragmatics of Speech Acts

1988English

Static Verification of Wireless Sensor Networks With Formal Methods

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy