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

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-02273-9_29
+Normal rank
@@ Property / OpenAlex ID @@
+W1733287636
@@ Property / OpenAlex ID: W1733287636 / rank @@
+Normal rank
@@ Property / cites work @@
+A Formal Language for Cryptographic Pseudocode
@@ Property / cites work: A Formal Language for Cryptographic Pseudocode / rank @@
+Normal rank
@@ Property / cites work @@
+Formal certification of code-based cryptographic proofs
+Normal rank
@@ Property / cites work @@
+A new recursion-theoretic characterization of the polytime functions
+Normal rank
@@ Property / cites work @@
+Foundations of Cryptography
@@ Property / cites work: Foundations of Cryptography / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218937
@@ Property / cites work: Q4218937 / rank @@
+Normal rank
@@ Property / cites work @@
+Safe recursion with higher types and BCK-algebra
@@ Property / cites work: Safe recursion with higher types and BCK-algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Logics for reasoning about cryptographic constructions
+Normal rank
@@ Property / cites work @@
+A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
+Normal rank
@@ Property / cites work @@
+Notions of computation and monads
@@ Property / cites work: Notions of computation and monads / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic lambda calculus and monads of probability distributions
+Normal rank