scientific article; zbMATH DE number 3965967
From MaRDI portal
Publication:3734302
[For the entire collection see Zbl 0583.00049.] We develop a simple model of computation under which to study the meaning of cryptographic protocol and security. We define a protocol as a mathematical object and security as a possible property of this object. Having formalized the concept of a secure protocol we study its general properties. We back up our contention that the model is reasonable by solving some well known cryptography problems within the framework of the model.
Recommendations
Cited in
(64)- On the freedom of decryption
- On the security of name-stamp protocols
- Proof of soundness (integrity) of cryptographic protocols
- Mathematical problems in cryptology
- Formalisation of Bayesian concealment
- MoSS: modular security specifications framework
- Secure communications with strange planet protocol
- The meeting businessmen problem: requirements and limitations
- Non interference for the analysis of cryptographic protocols
- Models for an adversary-centric protocol logic
- A secret-sharing protocol modelled in Maude
- A uniform framework for security and trust modeling and analysis with crypto-CCS
- About models of security protocols
- Security analysis of cryptographic protocols based on fine-grained freshness
- Transformations between Cryptographic Protocols
- Security Protocols: Principles and Calculi
- scientific article; zbMATH DE number 4191559 (Why is no real title available?)
- Practical design of two-party cryptographic protocols
- Cryptographic Protocols Analysis in Event B
- A new mutually undeniable cryptographic protocol and its formal analysis
- An algebraic approach to the verification of a class of Diffie-Hellman protocols
- Alice and Bob: reconciling formal models and implementation
- Cryptographycal protocols in the Egerfood Information System
- Cryptographic Protocol Explication and End-Point Projection
- Modelling Attacker’s Knowledge for Cascade Cryptographic Protocols
- Degrees of security: protocol guarantees in the face of compromising adversaries
- An improved formal model of cryptographic protocols
- scientific article; zbMATH DE number 3920370 (Why is no real title available?)
- scientific article; zbMATH DE number 4053510 (Why is no real title available?)
- Complexity-style resources in cryptography
- On using probabilistic Turing machines to model participants in cryptographic protocols
- On the security of public key protocols
- scientific article; zbMATH DE number 503347 (Why is no real title available?)
- Modeling complexity in secure distributed computing
- What makes a cryptographic protocol secure? The evolution of requirements specification in formal cryptographic protocol analysis
- Security properties: Two agents are sufficient
- scientific article; zbMATH DE number 2042808 (Why is no real title available?)
- A framework for the analysis of security protocols
- scientific article; zbMATH DE number 1497864 (Why is no real title available?)
- Financial cryptography in 7 layers
- Taming the adversary
- Innovative approaches for security of small artefacts
- scientific article; zbMATH DE number 1925560 (Why is no real title available?)
- The Verifiability of Two-Party Protocols
- Analyzing cryptographic protocols in a reactive framework
- Proof techniques for cryptographic protocols
- On an approach to the construction of secure connections
- Reducibility among protocols. (Extended abstract)
- Methodology for assessing the security of cryptographic protocols
- Cryptography and cryptographic protocols
- Formalization in PVS of balancing properties necessary for proving security of the Dolev-Yao cascade protocol model
- Skeletons, homomorphisms, and shapes: characterizing protocol executions
- Protocols with security proofs for mobile applications
- Trustworthy Global Computing
- Trustworthy Global Computing
- Extensions of information protocols based on mappings of finite sets
- Chaotic protocols
- Separating the specification and implementation phases in cryptology (extended abstract)
- A game-theoretic framework for specification and verification of cryptographic protocols
- Improvements on non-interactive zero-knowledge proof systems related to quadratic residuosity languages
- On the security aspects of protocol CRISP
- A simple model of secure public communication
- Algebra model and security analysis for cryptographic protocols
- Compiling and securing cryptographic protocols
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734302)