The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (Q3637209): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Formal Language for Cryptographic Pseudocode / 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: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe recursion with higher types and BCK-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logics for reasoning about cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic lambda calculus and monads of probability distributions / rank
 
Normal rank

Latest revision as of 17:59, 1 July 2024

scientific article
Language Label Description Also known as
English
The Computational SLR: A Logic for Reasoning about Computational Indistinguishability
scientific article

    Statements

    Identifiers