CryptHOL: game-based proofs in higher-order logic (Q2175214): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s00145-019-09341-z / rank
Normal rank
 
Property / cites work
 
Property / cites work: Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of randomized algorithms in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formal Language for Cryptographic Pseudocode / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic relational verification for cryptographic implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Security Proofs for the Working Cryptographer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling proofs are probabilistic product programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of code-based cryptographic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012877 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-Free Reasoning in Isabelle/Isar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friends with Benefits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truly Modular (Co)datatypes for Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to simulate it in Isabelle: towards formal proof for secure multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Termination and Composability of Cryptographic Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: A public key cryptosystem and a signature scheme based on discrete logarithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Fairness in Secure Two-Party Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Is a Pure Functional? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formalized Hierarchy of Probabilistic System Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting and Transfer: A Modular Design for Quotients in Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to protect DES against exhaustive key search (an analysis of DESX). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Another look at ``provable security'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Consistent Foundation for Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comprehending Isabelle/HOL’s Consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Data Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Functions and Cryptographic Oracles in Higher Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive Cryptography – A New Paradigm for Security Definitions and Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An equational approach to secure multi-party computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4077434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concrete Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Abstractions for Attested Execution Secure Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coinductive resumption monad / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic lambda calculus and monads of probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Probabilistic Characterizing Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptography made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure distributed programming with value-dependent types / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Synthesis of the Procedural and Declarative Styles of Interactive Theorem Proving / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00145-019-09341-Z / rank
 
Normal rank

Latest revision as of 08:56, 17 December 2024

scientific article
Language Label Description Also known as
English
CryptHOL: game-based proofs in higher-order logic
scientific article

    Statements

    CryptHOL: game-based proofs in higher-order logic (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2020
    0 references
    provable security
    0 references
    game-based proofs
    0 references
    theorem proving
    0 references
    higher-order logic
    0 references
    Isabelle/HOL
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references