No article text was recorded for this version.
symbolic-computational gap
Version 2 of 240 papers83 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Computational soundness of symbolic zero-knowledge proofs
- Blog: Computationally Sound Verification of Source Code
- Blog: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
- Blog: CoSP: A General Framework For Computational Soundness Proofs
- Blog: Cryptographically Sound Theorem Proving
- Blog: On the Cryptographic Key Secrecy of the Strengthened Yahalom Protocol
- Blog: On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
- Blog: Computational Soundness for Interactive Primitives
- Blog: Key confirmation and adaptive corruptions in the protocol security logic
- Blog: Computational Soundness of Symbolic Zero-knowledge Proofs: Weaker Assumptions and Mechanized Verification
- Blog: Key Exchange Protocols: Security Definition, Proof Method and Applications
- Blog: Limits of the Reactive Simulatability/UC of Dolev-Yao Models with Hashes
- Blog: Automated Analysis and Synthesis of Padding-Based Encryption Schemes
- Blog: Computationally Sound Secrecy Proofs by Mechanized Flow Analysis
- Blog: Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation
- Blog: Computational Soundness for Dalvik Bytecode
- Blog: Automated Verification of Accountability in Security Protocols
- Blog: Cryptographically Sound Security Proofs for Basic and Public-Key Kerberos
- Blog: Preface of Special Issue on “Computer Security: Foundations and Automated Reasoning”
- Blog: Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
- Blog: A Universally Composable Cryptographic Library
- Blog: Computationally Sound Abstraction and Verification of Secure Multi-Party Computations
- Blog: Inductive Proof Method for Computational Secrecy
- Blog: Computational Soundness Results for ProVerif - Bridging the Gap from Trace Properties to Uniformity
- Blog: From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
- Blog: An ontology-based approach to security pattern selection
- Blog: (De)Compositions of Cryptographic Schemes and their Applications to Protocols
- Blog: From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
- Blog: Formal Verification and Solutions for Estonian E-Voting
- Blog: Complementing Computational Protocol Analysis with Formal Specifications
- Blog: Bounded Key-Dependent Message Security
- Blog: Inductive Trace Properties for Computational Security
- Blog: Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme
- Blog: From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic
- Blog: A Type System for Data-Flow Integrity on Windows Vista
- Blog: Computational Soundness without Protocol Restrictions
- Blog: How to Wrap it up - A Formally Verified Proposal for the use of Authenticated Wrapping in PKCS#11
- Blog: Modeling Adversaries in a Logic for Security Protocol Analysis
- Blog: Integer Reasoning Modulo Different Constants in SMT
- Blog: A Logic for SDSI's Linked Local Name Spaces
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_symbolic_computational_gap_a3207953,
title = {symbolic-computational gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/symbolic-computational-gap/rdr_a32079533a6a4873b474782874fc4534},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 2, frozen text):
@misc{lacuna_symbolic_computational_gap_a3207953_v2,
title = {symbolic-computational gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/symbolic-computational-gap/rdr_a32079533a6a4873b474782874fc4534/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-19},
}