Soundness of Formal Encryption in the Presence of Active Adversaries

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-24638-1_8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Computational Soundness of Formal Indistinguishability and Static Equivalence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Key-Dependent Message Security Under Active Attacks – BRSIM/UC-soundness of Dolev–Yao-Style Encryption With Key Cycles

Journal of Computer Security
RiskComputer NetworksHardwareCommunicationsReliabilitySafetyArchitectureQualitySoftware
2008English

Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Formal Treatment of Remotely Keyed Encryption

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Encryption-Scheme Security in the Presence of Key-Dependent Messages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Classifier Evaluation and Attribute Selection Against Active Adversaries

Data Mining and Knowledge Discovery
Computer NetworksComputer Science ApplicationsInformation SystemsCommunications
2010English

Sound Computational Interpretation of Formal Encryption With Composed Keys

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries

2015English

On the Power of Non-Spoofing Adversaries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy