yusuke1997/dblp-id-title huggingface dataset:
Information Flow in Systems with Schedulers
Collusion-Deterrent Threshold Information Escrow
An Analysis of some Delegation Protocols for Distributed Systems
sElect: A Lightweight Verifiable Remote Voting System
Journey Beyond Full Abstraction: Exploring Robust Property Preservation for Secure Compilation
Algebraic properties of system composition in the LORAL, Ulysses and McLean trace models
The Attack Navigator
Non-interference with What-Declassification in Component-Based Systems
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
Security and the Composition of Machines
Nonmonotonic Cryptographic Protocols
A Logic For State Transformations in Authorization Policies
Anonymous Lottery In The Proof-of-Stake Setting
Identity Based Authenticated Key Agreement Protocols from Pairings
Local Memory via Layout Randomization
StatVerif: Verification of Stateful Processes
DDUO: General-Purpose Dynamic Analysis for Differential Privacy
Proving Security Protocols with Model Checkers by Data Independence Techniques
On the Structure of Delegation Networks
Application-Sensitive Access Control Evaluation Using Parameterized Expressiveness
Athena: A New Efficient Automatic Checker for Security Protocol Analysis
Runtime Enforcement for Control System Security
Calculational Design of Information Flow Monitors
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Secure Compilation of Constant-Resource Programs
Integrated Visualization of Network Security Metadata from Heterogeneous Data Sources
Additive and Multiplicative Notions of Leakage, and Their Capacities
Securing Asynchronous Exceptions
An Efficient Non-repudiation Protocol
A Formal Framework for Provenance Security
Required Information Release
Compositional Security for Task-PIOAs
The Complexity of Monitoring Hyperproperties
Adversarial Robustness Verification and Attack Synthesis in Stochastic Systems
Nomad: A Security Model with Non Atomic Actions and Deadlines
Universally Composable Symmetric Encryption
LTL Model Checking for Security Protocols
Symbolic Universal Composability
Provably Robust Decisions based on Potentially Malicious Sources of Information
Cryptographically-Sound Protocol-Model Abstractions
Separation of Duty using High Water Marks
A Formal Model of Security Dependency for Analysis and Testing of Secure Systems
Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant
A Method for Proving Unlinkability of Stateful Protocols
Indistinguishability Beyond Diff-Equivalence in ProVerif
Refinement Types for Secure Implementations
Analyzing Single-Server Network Inhibition
Specification and Analysis of Dynamic Authorisation Policies
Mechanized proofs for a recursive authentication protocol
Certified Synthesis of Efficient Batch Verifiers
Dynamic Enforcement of Knowledge-Based Security Policies
Information-Flow Security for a Core of JavaScript
BeleniosVS: Secrecy and Verifiability Against a Corrupted Voting Device
Honest Ideals on Strand Spaces
A Non-monotonic Typed Multilevel Logic for Multilevel Secure Data/Knowledge - II
SysML-Sec Attack Graphs: Compact Representations for Complex Attacks
Zero-Knowledge in EasyCrypt
Connection policies and controlled interference
Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers
A Privacy Policy Model for Enterprises
Compositional Verification and Refinement of Concurrent Value-Dependent Noninterference
Providing a Flexible Security Override for Trusted Systems
Cryptographically Sound Theorem Proving
Automatically Detecting the Misuse of Secrets: Foundations, Design Principles, and Applications
Relating Strands and Multiset Rewriting for Security Protocol Analysis
Wappler: Sound Reachability Analysis for WebAssembly
A Logic of Sattestation
Petri Net Based Modelling of Information Flow Security Requirements
Using Information Flow to Design an ISA that Controls Timing Channels
Symbolic and Computational Mechanized Verification of the ARINC823 Avionic Protocols
How to Generate Security Cameras: Towards Defence Generation for Socio-Technical Systems
A Calculus for Flow-Limited Authorization
Formal Security Analysis of the OpenID FAPI 2.0: Accompanying a Standardization Process
An Extension of the Adversarial Threat Model in Quantitative Information Flow
Securing P4 Programs by Information Flow Control
Controlled Signalling Systems and Covert Channels
VRaaS: Verifiable Randomness as a Service on Blockchains
Graphical Models for Security - 4th International Workshop, GraMSec 2017, Santa Barbara, CA, USA, August 21, 2017, Revised Selected Papers
Noninterference and the Unwinding for LOCK
One-Representative Safety Analysis in the Non-Monotonic Transform Model
Authentication via Localized Names
Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks
Leakage-Minimal Design: Universality, Limitations, and Applications
An Extensive Formal Analysis of Multi-factor Authentication Protocols
Modeling Human Errors in Security Protocols
Decidability of a Sound Set of Inference Rules for Computational Indistinguishability
Automatic Verification of Finite Variant Property Beyond Convergent Equational Theories
An Approach to Increasing the Automation of the Verification of Security
A Computational Analysis of the Needham-Schröeder-(Lowe) Protocol
Picking vs. Guessing Secrets: A Game-Theoretic Analysis
Toward a Universal Integrity Model
Tight Bounds on Information Leakage from Repeated Independent Runs
Achieving Information Flow Security through Precise Control of Effects
Protocol Independence through Disjoint Encryption
Quantitative Verification and Synthesis of Attack-Defence Scenarios
33rd IEEE Computer Security Foundations Symposium, CSF 2020, Boston, MA, USA, June 22-26, 2020
Security and Privacy by Declarative Design
Relational Analysis of Sensor Attacks on Cyber-Physical Systems
HoRStify: Sound Security Analysis of Smart Contracts
Zero-Knowledge Proofs from Learning Parity with Noise: Optimization, Verification, and Application
Mechanised Models and Proofs for Distance-Bounding
IEEE 29th Computer Security Foundations Symposium, CSF 2016, Lisbon, Portugal, June 27 - July 1, 2016
Formal Analysis of Protocols Based on TPM State Registers
Beyond Good and Evil: Formalizing the Security Guarantees of Compartmentalizing Compilation
Accountable Bulletin Boards: Definition and Provably Secure Implementation
Is Eve nearby? Analysing protocols under the distant-attacker assumption
Differential Privacy: An Economic Method for Choosing Epsilon
Symbolic Malleable Zero-Knowledge Proofs
Intensional specifications of security protocols
A Logical Framework for Reasoning on Data Access Control Policies
Confining Adversary Actions via Measurement
A Sound Abstraction of the Parsing Problem
Towards a General-Purpose Dynamic Information Flow Policy
AnoA: A Framework for Analyzing Anonymous Communication Protocols
On the Soundness of Infrastructure Adversaries
31st IEEE Computer Security Foundations Symposium, CSF 2018, Oxford, United Kingdom, July 9-12, 2018
A Security Framework
Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
Stateful Declassification Policies for Event-Driven Programs
Deterministic Channel Design for Minimum Leakage
A General Approach to Tranquility in Information Flow Analysis
Panel: Use of Formal Methods in the Analysis of Cryptographic Protocols
SoK: Techniques for Verifiable Mix Nets
On Generalized Authorization Problems
Secure Dependencies with Dynamic Level Assignments
Extending the Authentication Hierarchy with One-Way Agreement
Provably Secure and Practical Onion Routing
Automated Generation of Attack Trees
On Sustainable Ring-Based Anonymous Systems
Formal Verification of Secure Forwarding Protocols
SecurePtrs: Proving Secure Compilation with Data-Flow Back-Translation and Turn-Taking Simulation
The Expressive Power of Multi-Parent Creation in a Monotonic Access Control Model
A Coq proof of the correctness of X25519 in TweetNaCl
Modelling Downgrading in Information Flow Security
Automated Verification of Accountability in Security Protocols
Specifying security for CSCW systems
Variations and Extensions of Information Leakage Metrics with Applications to Privacy Problems with Imperfect Statistical Information
A Library for Secure Multi-threaded Information Flow in Haskell
The Anatomy and Facets of Dynamic Policies
Quantifying Information Flow
Robust Declassification
Secure Composition of Insecure Components
Basilic: Resilient-Optimal Consensus Protocols with Benign and Deceitful Faults
Post-Quantum Sound CryptoVerif and Verification of Hybrid TLS and SSH Key-Exchanges
A Game-Theoretic Study on Non-monetary Incentives in Data Analytics Projects with Privacy Implications
Panel: Fundamental Questions about Formal Methods
A Definitional Framework for Functional Encryption
Implementing STV securely in Pret a Voter
An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols
Probabilistic Program Modeling for High-Precision Anomaly Classification
Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications
A Composable Security Treatment of the Lightning Network
Unconditionally Secure MPC for Boolean Circuits With Constant Online Communication
A Theory of Information-Flow Labels
Proving Unlinkability Using ProVerif Through Desynchronised Bi-Processes
Reconciling Privacy and Utility in Continuous-Time Diffusion Networks
Consensus Redux: Distributed Ledgers in the Face of Adversarial Supremacy
Universally Composable Signature, Certification, and Authentication
Automated Analysis and Synthesis of Block-Cipher Modes of Operation
Survivability Analysis of a Computer System Under an Advanced Persistent Threat Attack
Key-dependent Message Security under Active Attacks - BRSIM/UC-Soundness of Symbolic Encryption with Key Cycles
Proceedings of the 24th IEEE Computer Security Foundations Symposium, CSF 2011, Cernay-la-Ville, France, 27-29 June, 2011
Improving Count-Mean Sketch as the Leading Locally Differentially Private Frequency Estimator for Large Dictionaries
Nonmalleable Progress Leakage
18th IEEE Computer Security Foundations Workshop, (CSFW-18 2005), 20-22 June 2005, Aix-en-Provence, France
Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties
Verified Translation Validation of Static Analyses
Clockwork: Tracking Remote Timing Attacks
Program Actions as Actual Causes: A Building Block for Accountability
Foundations for Intrusion Detection?
Secure Information Flow Using Security Groups
A Policy Model for Denial of Service
Graphical Models for Security - Third International Workshop, GraMSec 2016, Lisbon, Portugal, June 27, 2016, Revised Selected Papers
Mignis: A Semantic Based Tool for Firewall Configuration
Safety via State Transition Language Plus Invariants
A Framework for the Sound Specification of Cryptographic Tasks
Nominal State-Separating Proofs
Cryptographically Enforced RBAC
Abstraction-Based Misuse Detection: High-Level Specifications and Adaptable Strategies
Static Analysis for Efficient Hybrid Information-Flow Control
Understanding SPKI/SDSI Using First-Order Logic
Guided Specification and Analysis of a Loyalty Card System
A Methodology for Information Flow Experiments
Transparent IFC Enforcement: Possibility and (In)Efficiency Results
ENCoVer: Symbolic Exploration for Information Flow Security
$\pi_{\mathbf{RA}}$: A $\pi\text{-calculus}$ for Verifying Protocols that Use Remote Attestation
On Dynamic Flow-Sensitive Floating-Label Systems
How and why feedback composition fails [secure systems]
Panel Discussion on the Polyinstantiation Problem: A Position Paper
Electing the Doge of Venice: Analysis of a 13th Century Protocol
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
Reasoning about Concurrency for Security Tunnels
Mashic Compiler: Mashup Sandboxing Based on Inter-frame Communication
Actual Knowledge Gain as Privacy Loss in Local Privacy Accounting
Hook-Up Property of Information Flow Secure Nets
Symbolic Model Checking the Knowledge of the Dining Cryptographers
What Needs Securing
Formalizing Constructive Cryptography using CryptHOL
On Separation Logic, Computational Independence, and Pseudorandomness
Hybrid Monitors for Concurrent Noninterference
Do As I SaY! Programmatic Access Control with Explicit Identities
Formal Semantics of Rights and Confidentiality in Definite Deductive Databases
32nd IEEE Computer Security Foundations Symposium, CSF 2019, Hoboken, NJ, USA, June 25-28, 2019
Formal Robustness for Cyber-Physical Systems Under Timed Attacks
Polynomial Fairness and Liveness
On Belief Evolution in Authentication Protocols
Confidentiality in a Replicated Architecture Trusted Database System: A Formal Model
IEEE 27th Computer Security Foundations Symposium, CSF 2014, Vienna, Austria, 19-22 July, 2014
A Universally Composable Treatment of Network Time
Guided Design of Attack Trees: A System-Based Approach
Formal Analysis of PKCS#11
Symbolic Security of Garbled Circuits
A Method for Proving Observational Equivalence
A Permission-Dependent Type System for Secure Information Flow Analysis
Modeling and Verifying Ad Hoc Routing Protocols
A Derivation System for Security Protocols and its Logical Formalization
Local Names in SPKI/SDSI
Security Engineering of Lattice-Based Policies
Information-Flow Control for Programming on Encrypted Data
Dynamic IFC Theorems for Free!
Towards a Theory of Penetration-Resistant Systems and its Applications
Language Based Secure Communication
Panel: Reconsidering the Role fo the Reference Monitor
Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
On Key Assignment for Hierarchical Access Control
Information Flow Control for Distributed Trusted Execution Environments
Formal Semantics for Logics of Cryptographic Protocols
Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries
KACHINA - Foundations of Private Smart Contracts
Achieving Security Despite Compromise Using Zero-knowledge
Information Flow Control for Event Handling and the DOM in Web Browsers
In the Nick of Time: Proactive Prevention of Obligation Violations
How to Prevent Type Flaw Attacks on Security Protocols
Information Flow Analysis for a Dynamically Typed Language with Staged Metaprogramming
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
Runtime Verification of k-Safety Hyperproperties in HyperLTL
Secrecy by Typing in the Computational Model
Representing Partial Knowledge in an Algebraic Security Model
Owned Policies for Information Security
20th IEEE Computer Security Foundations Symposium, CSF 2007, 6-8 July 2007, Venice, Italy
Portable Software Fault Isolation
A small bound on the number of sessions for security protocols
14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 11-13 June 2001, Cape Breton, Nova Scotia, Canada
Modular Protections against Non-control Data Attacks
Formal Methods for the Informal World
Looking for Diamonds in the Desert - Extending Automatic Protocol Generation to Three-Party Authentication and Key Agreement Protocols
Machine-Checked Proofs for Electronic Voting: Privacy and Verifiability for Belenios
Game Analysis of Abuse-free Contract Signing
Formal Verification of Privacy for RFID Systems
Policy Compliance in Collaborative Systems
AGATE: Augmented Global Attested Trusted Execution in the Universal Composability Framework
Gran: Model Checking Grsecurity RBAC Policies
Theft of Information in the Take-Grant Protection Model
Static Enforcement of Security in Runtime Systems
Access Control Policies: Some Unanswered Questions
A Nonmonotonic Typed Multilevel Logic for Multilevel Secure Database/Knowledge-Based Management Systems
Language generation and verification in the NRL protocol analyzer
Attacking and Fixing Helios: An Analysis of Ballot Secrecy
Secure Compilation of Side-Channel Countermeasures: The Case of Cryptographic "Constant-Time"
Composing Secure Systems that have Emergent Properties
Approximate Non-Interference
Who's Afraid of Which Bad Wolf? A Survey of IT Security Risk Awareness
Causality-based Abstraction of Multiplicity in Security Protocols
Universal Optimality and Robust Utility Bounds for Metric Differential Privacy
Compositional Information-Flow Security for Interactive Systems
Proceedings of the 11th IEEE Computer Security Foundations Workshop, Rockport, Massachusetts, USA, June 9-11, 1998
Tight Enforcement of Information-Release Policies for Dynamic Languages
Enterprise Architecture-Based Risk and Security Modelling and Analysis
Abstract Modeling of System Communication in Constructive Cryptography using CryptHOL
An augmentation of BAN-like logics
Proving Flow Security of Sequential Logic via Automatically-Synthesized Relational Invariants
Attribute Support for Inter-Domain Use
Dynamic Group Signatures with Verifier-Local Revocation
Computing Symbolic Models for Verifying Cryptographic Protocols
Quantitative Information Flow - Verification Hardness and Possibilities
A Class of Flexible and Efficient Key Management Protocols
Formal Verification of Protocols Based on Short Authenticated Strings
Automated Support for External Consistency
Information Flow in Credential Systems
Divide and Funnel: A Scaling Technique for Mix-Networks
A Meta-Notation for Protocol Analysis
Verifying Accountability for Unbounded Sets of Participants
Language-Based Information Erasure
The composability of non-interference [system security]
Memory Trace Oblivious Program Execution
Minimal Message Complexity of Asynchronous Multi-party Contract Signing
An Efficient Cryptographic Protocol Verifier Based on Prolog Rules
Understanding and Enforcing Opacity
Fault-Resilient Non-interference
A Formal Framework and Evaluation Method for Network Denial of Service
Disjunctive Policies for Database-Backed Programs
Games for Security Under Adaptive Adversaries
Computationally Bounded Robust Compilation and Universally Composable Security
Re-Thinking Untraceability in the CryptoNote-Style Blockchain
Formal Verification of the Sumcheck Protocol
A State-Based Approach to Non-Interference
An Authorization Logic With Explicit Time
Mapping Synthesis for Hyperproperties
Action Systems for Security Specification
AUTLOG - An Advanced Logic of Authentication
A New Polyinstantiation Integrity Constraint for Multilevel Relations
Modelling and verifying key-exchange protocols using CSP and FDR
The Basic Integrity Theorem
Lorenz and Colossus
Privacy-Preserving Server-Supported Decryption
A Logic-based Knowledge Representation for Authorization with Delegation
Cryptographic Types
Optimising Faceted Secure Multi-Execution
Dynamic Dependency Monitoring to Secure Information Flow
A Security Analysis of the Cliques Protocols Suites
Possibilistic Definitions of Security - An Assembly Kit
Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis
PASAPTO: Policy-aware Security and Performance Trade-off Analysis-Computation on Encrypted Data with Restricted Leakage
Analysis of a Storage Channel in the Two-Phase Commit Protocol
Modular Verification for Computer Security
Command Authorization as a Component of Information Integrity
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, CSF 2009, Port Jefferson, New York, USA, July 8-10, 2009
Bayes Security: A Not So Average Metric
A Complete Characterization of Secure Human-Server Communication
Robustness Guarantees for Anonymity
Independence From Obfuscation: A Semantic Framework for Dive
Preimage Awareness in Linicrypt
Secure Synthesis of Distributed Cryptographic Applications
Security Function Interactions
Eliminating Covert Flows with Minimum Typings
Attack Tree Metrics are Operad Algebras
Dealing with Dynamic Key Compromise in Crypto Verif
The epistemic representation of information flow security in probabilistic systems
Composing and decomposing systems under security properties
Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR
A classical Automata Approach to Noninterference Type Problems
Cooking Cryptographers: Secure Multiparty Computation Based on Balls and Bags
Automated Analysis of PUF-based Protocols
Axioms for Information Leakage
On Power Splitting Games in Distributed Computation: The Case of Bitcoin Pooled Mining
A Decision Procedure for Alpha-Beta Privacy for a Bounded Number of Transitions
A Logic of Knowledge and Belief for Reasoning about Computer Security
DPL: A Language for GDPR Enforcement
Optimal authentication protocols resistant to password guessing attacks
Cassandra: Flexible Trust Management, Applied to Electronic Health Records
The Sea View Verification
Evaluating and Improving Protocol Analysis by Automatic Proof
Formal Impact Metrics for Cyber-physical Attacks
Abstract Machines for Communication Security
Multi-Phase Damage Confinement in Database Systems for Intrusion Tolerance
On Access Control, Capabilities, Their Equivalence, and Confused Deputy Attacks
A Bottom-Up Approach to Applying Graphical Models in Security Analysis
Types for Location and Data Security in Cloud Environments
Information-Flow Security for Interactive Programs
Secure Information Flow for Concurrent Programs under Total Store Order
Automatic Validation of Protocol Narration
The non-primitiveness of the simple-security property and its non-applicability to relational databases
Panel: What are the Foundations of Computer Security?
A Little More Conversation, a Little Less Action, a Lot More Satisfaction: Global States in ProVerif
Rethinking Large-Scale Consensus
A Systematic and Formal Study of the Impact of Local Differential Privacy on Fairness: Preliminary Results
Reconstruction of Attacks against Cryptographic Protocols
Urgency in Cybersecurity Risk Management: Toward a Solid Theory
Efficient Algorithms for Quantitative Attack Tree Analysis
19th IEEE Computer Security Foundations Workshop, (CSFW-19 2006), 5-7 July 2006, Venice, Italy
Enforcing Ideal-World Leakage Bounds in Real-World Secret Sharing MPC Frameworks
Securing Databases from Probabilistic Inference
Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers
Security Modeling for Embedded System Design
Language Support for Secure Software Development with Enclaves
Quantification of Integrity
On the Completeness of Attack Mutation Algorithms
Analysis of Typed Analyses of Authentication Protocols
A Logic of Composition for Information Flow Predicates
Covert Channels and Degrees of Insecurity
Securing Optimized Code Against Power Side Channels
Hookup Security for Synchronous Machines
Managing Policy Updates in Security-Typed Languages
Formal Policies for Trusted Processes
A Simple Logic for Authentication Protocol Design
Formalizing and Proving a Typing Result for Security Protocols in Isabelle/HOL
Du-Vote: Remote Electronic Voting with Untrusted Computers
Employing Graphical Risk Models to Facilitate Cyber-Risk Monitoring - the WISER Approach
Run-Time Attack Detection in Cryptographic APIs
Election Verifiability Revisited: Automated Security Proofs and Attacks on Helios and Belenios
Information Flow Monitor Inlining
Panel Introduction: Varieties of Authentication
Implicit Discretionary Access Propagation: A new Interpretation of DAC
Abstracting Faceted Execution
A Temporal Logic Characterisation of Observational Determinism
E-Commerce Payment Protocols: Requirements and Analysis
Proceedings of the 21st IEEE Computer Security Foundations Symposium, CSF 2008, Pittsburgh, Pennsylvania, USA, 23-25 June 2008
Smart Contract Synthesis Modulo Hyperproperties
Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks
Security Models for Priority Buffering and Interrupt Handling
DKAL: Distributed-Knowledge Authorization Language
Efficient Finite-State Analysis for Large Security Protocols
Probabilistic Point-to-Point Information Leakage
A Certified Compiler for Verifiable Computing
Categorizing non-interference
A High-Throughput Secure Reliable Multicast Protocol
Hyperproperties
10th Computer Security Foundations Workshop (CSFW '97), June 10-12, 1997, Rockport, Massachusetts, USA
Using Active Learning in Intrusion Detection
A Secure Cryptographic Token Interface
Security Analysis of Role-Based Access Control through Program Verification