yusuke1997/dblp-id-title huggingface dataset:
Incremental Verification Using Trace Abstraction
Semantic Analyzer of Modula-Programs
Modular Optimization-Based Roundoff Error Analysis of Floating-Point Programs
On the Role of Cognizance in Responsibility
Abstract Interpretation over Non-lattice Abstract Domains
Interprocedural Analysis with Lazy Propagation
Binary Reachability Analysis of Higher Order Functional Programs
Optimized Algorithms for Incremental Analysis of Logic Programs
A Few Graph-Based Relational Numerical Abstract Domains
Control Flow Analysis for the Join Calculus
Widening and Interpolation
Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
Increasing the Scope and Resolution of Interprocedural Static Single Assignment
Verifying Array Manipulating Programs by Tiling
Set-Based Analysis for Logic Programming and Tree Automata
Data Dependence as Abstract Interpretations
Automated Modular Termination Proofs for Real Prolog Programs
Property-Oriented Expansion
Synthesizing Heap Manipulations via Integer Linear Programming
Avoiding Repeated Tests in Pattern Matching
Compiling Laziness Using Projections
AURA: Precise Abstract Interpretation of Probabilistic Programs with Interval Data Uncertainty
An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages
Analysis of Software Patches Using Numerical Abstract Interpretation
Static Analysis - 22nd International Symposium, SAS 2015, Saint-Malo, France, September 9-11, 2015, Proceedings
Property-Driven Code Obfuscations Reinterpreting Jones-Optimality in Abstract Interpretation
Selective Context-Sensitivity for k-CFA with CFL-Reachability
Modular Static Analysis of String Manipulations in C Programs
Alternation for Termination
Finding Non-terminating Executions in Distributed Asynchronous Programs
True Concurrency via Abstract Interpretation
SJS: A Type System for JavaScript with Fixed Object Layout
Mutual Refinements of Context-Free Language Reachability
Semantics and Analysis of Linda-Based Languages
Existential Label Flow Inference Via CFL Reachability
Static Analysis, 10th International Symposium, SAS 2003, San Diego, CA, USA, June 11-13, 2003, Proceedings
Verified Functional Programming of an Abstract Interpreter
Practical Compile-Time Analysis
Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology
Abstract Interpretation Using TDGs
Estimating the Impact of Scalable Pointer Analysis on Optimization
Automatic Synthesis of Deterministic Concurrency
Automatic Generation of Valid Linear Measures for CLP(Q) Programs
Approximating the Algebraic Relational Semantics of Imperative Programs
Process-Local Static Analysis of Synchronous Processes
Exact Flow Analysis
A Library Modeling Language for the Static Analysis of C Programs
Abstract Interpretation of Stateful Networks
Unleashing the Power of Static Analysis
A Transformational Approach for Generating Non-linear Invariants
A Relational Approach to Interprocedural Shape Analysis
Optimization Techniques for General Purpose Fixpoint Algorithms - Practical Efficiency for the Abstract Interpretation of Prolog
Efficient FixPoint Computation
Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes
Abstract Interpretation: A Theory of Approximate Computation
Flow Analysis, Linearity, and PTIME
Locality-Based Abstractions
Quantum Entanglement Analysis Based on Abstract Interpretation
Widening Operators for Weakly-Relational Numeric Abstractions
An Algebraic Approach to the Static Analysis of Concurrent Software
Information Flow Analysis in Logical Form
Analysis of Imperative Programs through Analysis of Constraint Logic Programs
Lifting Numeric Relational Domains to Algebraic Data Types
Abstract Rewriting
Compile-time Detection of Uncaught Exceptions in Standard ML Programs
Static Analysis of Communication for Asynchronous Concurrent Programming Languages
Verifying a Local Generic Solver in Coq
Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL
Rethinking Static Analysis by Combining Discrete and Continuous Reasoning
Thunks (Continued)
A Congruence for Gamma Programs
Recency-Abstraction for Heap-Allocated Storage
Abstract Interpretation of Supermodular Games
Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
Bilateral Algorithms for Symbolic Abstraction
Shape Analysis for Low-Level Code
Thread-Modular Analysis of Release-Acquire Concurrency
Model-Checking: A Tutorial Introduction
Termination Analysis for Offline Partial Evaluation of a Higher Order Functional Language
Computations, Abstractions and Constraints (abstract)
Incompleteness, Counterexamples, and Refinements in Abstract Model-Checking
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
The Costs and Benefits of Abstract Interpretation-driven Prolog Optimization
Incremental Analysis for Probabilistic Programs
Termination Proofs for Linear Simple Loops
Unconstrained Variable Oracles for Faster Numeric Static Analyses
Verifying Neural Networks with PyRAT
Finite-Tree Analysis for Constraint Logic-Based Languages
Separation Logic and Program Analysis
Probabilistic Lipschitz Analysis of Neural Networks
Parallel Cost Analysis of Distributed Systems
Banshee: A Scalable Constraint-Based Analysis Toolkit
Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs
Verification of Linear Hybrid Systems by Means of Convex Approximations
Directional Type Inference for Logic Programs
Per-Dereference Verification of Temporal Heap Safety via Adaptive Context-Sensitive Analysis
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language
A Systematic Construction of Abstract Domains
Modular Demand-Driven Analysis of Semantic Difference for Program Versions
An Abstract Domain to Infer Types over Zones in Spreadsheets
A Multilanguage Static Analysis of Python Programs with Native C Extensions
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties
A Logic for Analyzing Abstractions of Graph Transformation Systems
Generalized Boxings, Congruences and Partial Inlining
Abstract Interpretation-Based Static Analysis of Mobile Ambients
Abstract Animator for Temporal Specifications: Application to TLA
On the Limits of the Classical Approach to Cost Analysis
Analysis of Normal Logic Programs
Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT
Generalising Deforestation for All First-Order Functional Programs
Improving Control in Functional Logic Program Specialization
Stratified Guarded First-Order Transition Systems
Effective Specialization of Realistic Programs via Use Sensitivity
On Static Properties of Specialized Programs
Experience Developing and Deploying Concurrency Analysis at Facebook
Reasoning about Control Flow in the Presence of Transient Faults
Verifying Fence Elimination Optimisations
Beyond Prototype Implementations: Polymorphic Projection Analysis for Glasgow Haskell
A Decision Tree Abstract Domain for Proving Conditional Termination
Formal Model Reduction
Should We Balance? Towards Formal Verification of the Linux Kernel Scheduler
Backward Type Inference Generalises Type Checking
Equational Logics
Syntactic and Semantic Soundness of Structural Dataflow Analysis
Modularity in Lattices: A Case Study on the Correspondence Between Top-Down and Bottom-Up Analysis
Abstract Interpretation of Indexed Grammars
Binding-Time Analysis and Strictness Analysis by Abstract Interpretation
Relevant Logic and Strictness Analysis
Static Analysis - 19th International Symposium, SAS 2012, Deauville, France, September 11-13, 2012. Proceedings
Concise Analysis Using Implication Algebras for Task-Local Memory Optimisation
A propos des redondances dans les systèmes d'inéquations linéaires
Algorithmic Verification of Systems Software Using SMT Solvers
Actes JTASPEFL'91 (Bordeaux, France), October 1991, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Proceedings
PAN - The Prolog Analyzer
Explaining the Effectiveness of Small Refinement Heuristics in Program Verification with CEGAR
Abstract Interpretation of FIFO Replacement
Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Quantitative Static Timing Analysis
Static Analysis, First International Static Analysis Symposium, SAS'94, Namur, Belgium, September 28-30, 1994, Proceedings
Analyse et transformation de programmes Prolog en vue de leur parallélisation avec les prédicats parand et paror
Solving Regular Tree Grammar Based Constraints
Control-Flow Analysis and Type Systems
Monarch: A Modular Framework for Abstract Definitional Interpreters in Haskell
Algorithmic Game Semantics and Static Analysis
Techniques de transformations de programmes Prolog généraux et validation de méta-interpréteurs
Strictness Properties of Lazy Algebraic Datatypes
Real Terrain Visualisation on the Basis of GIS Data
Intelligent Media Technology for Communicative Intelligence, Second International Workshop, IMTCI 2004, Warsaw, Poland, September 13-14, 2004, Revised Selected Papers
Collage of Video and Sound for Raising the Awareness of Situated Conversations
The Explanatory Experiment for Evaluation of SPOC System from Contents Creators' Perspective
Do We Need Automatic Indexing of Musical Instruments?
Mobile Agents: Preserving Privacy and Anonymity
Calculus with Fuzzy Numbers
Toward Enhancing User Involvement via Empathy Channel in Human-Computer Interface Design
Enriching Agent Animations with Gestures and Highlighting Effects
Multi-level Annotation in SpeeCon Polish Speech Database
Reliable Data Acquisition Systems for Robotics and Multimedia Applications
Named-Entity Recognition for Polish with SProUT
Towards Intelligent Media Technology for Communicative Intelligence
Towards Extracting Emotions from Music
Text Understanding for Conversational Agent
Design Intelligent Web Applications Using Web Modelling Language (WebML)
Forecasting with a Dynamic Window of Time: The DyFor Genetic Program Model
Dialogue Processing Memory for Incident Solving in Man-Machine Dialogue
Intelligent Content Production for a Virtual Speaker
Intelligent Content Extraction from Polish Medical Reports
Towards 3D Face Model from 2D View
A Survey of Recent Results on Spatial Reasoning via Rough Inclusions
Facilitating Understanding for Children by Translating Web Contents into a Storybook
Smart Sensor Mesh: Intelligent Sensor Clusters Configuration and Location Discovery for Collaborative Information Processing
Intelligent Data Integration Middleware Based on Updateable Views
A Question Answer System Using Mails Posted to a Mailing List
Black-Box Anonymous Commit-and-Prove
On Adaptively Secure Protocols
Reducing the Overhead of MPC over a Large Population
Systematizing Secure Computation for Research and Decision Support
Security and Cryptography for Networks, 7th International Conference, SCN 2010, Amalfi, Italy, September 13-15, 2010. Proceedings
Bounded Size-Hiding Private Set Intersection
MyOPE: Malicious SecuritY for Oblivious Polynomial Evaluation
More Efficient Commitments from Structured Lattice Assumptions
On the Power of Claw-Free Permutations
Zero-Knowledge Made Easy so It Won't Make You Dizzy - (A Tale of Transaction Put in Verse About an Illicit Kind of Commerce)
How to Embed Short Cycles into Large Nonlinear Feedback-Shift Registers
Security in Communication Networks, 4th International Conference, SCN 2004, Amalfi, Italy, September 8-10, 2004, Revised Selected Papers
Equivocable and Extractable Commitment Schemes
Fully Collision-Resistant Chameleon-Hashes from Simpler and Post-quantum Assumptions
Solving Revocation with Efficient Update of Anonymous Credentials
Blackbox Construction of a More Than Non-Malleable CCA1 Encryption Scheme from Plaintext Awareness
Time-Specific Encryption
Multi-clients Verifiable Computation via Conditional Disclosure of Secrets
Faster Maliciously Secure Two-Party Computation Using the GPU
On the Key Exposure Problem in Chameleon Hashes
Linear Bandwidth Naccache-Stern Encryption
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
Algorithmic Tamper-Proof Security under Probing Attacks
Group Signatures with Separate and Distributed Authorities
A New Key Exchange Protocol Based on MQV Assuming Public Computations
Unforgeable Watermarking Schemes with Public Extraction
Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs
Relationships Between Diffie-Hellman and "Index Oracles"
Constructing Elliptic Curves with Prescribed Embedding Degrees
A Signature Scheme with Efficient Protocols
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
Account Management in Proof of Stake Ledgers
Secret Sharing Schemes for Dense Forbidden Graphs
Pen and Paper Arguments for SIMON and SIMON-like Designs
Universally Composable DKG with Linear Number of Exponentiations
Efficient 3-Party Distributed ORAM
Constrained Verifiable Random Functions
Non-randomness of the Full 4 and 5-Pass HAVAL
Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption
Get Shorty via Group Signatures without Encryption
Client-Aided Privacy-Preserving Machine Learning
On the Security of HMAC and NMAC Based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (Extended Abstract)
Encrypted Multi-map that Hides Query, Access, and Volume Patterns
A Tag Based Encoding: An Efficient Encoding for Predicate Encryption in Prime Order Groups
Watermarkable Public Key Encryption with Efficient Extraction Under Standard Assumptions
Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map
Secure Generalized Deduplication via Multi-Key Revealing Encryption
Memory Erasability Amplification
On a Class of Key Agreement Protocols Which Cannot Be Unconditionally Secure
On Secure Orders in the Presence of Faults
Security and Cryptography for Networks - 13th International Conference, SCN 2022, Amalfi, Italy, September 12-14, 2022, Proceedings
Zero-Knowledge for Homomorphic Key-Value Commitments with Applications to Privacy-Preserving Ledgers
An Empirical Study and Some Improvements of the MiniMac Protocol for Secure Computation
Cheating Immune (2, n )-Threshold Visual Secret Sharing
Minimalist Cryptography for Low-Cost RFID Tags
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships
Ring Switching in BGV-Style Homomorphic Encryption
Fast Secure Computation of Set Intersection
Fast Threshold ECDSA with Honest Majority
Gradual GRAM and Secure Computation for RAM Programs
NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness
Forward Secrecy in Password-Only Key Exchange Protocols
Some Applications of Polynomials for the Design of Cryptographic Protocols
Chosen Ciphertext Security on Hard Membership Decision Groups: The Case of Semi-smooth Subgroups of Quadratic Residues
A New DPA Countermeasure Based on Permutation Tables
Publicly Auditable Secure Multi-Party Computation
Forward-Secure Signatures with Fast Key Update
Streaming and Unbalanced PSI from Function Secret Sharing
How (Not) to Simulate PLONK
On the Security Properties of e-Voting Bulletin Boards
Semantically Secure Anonymity: Foundations of Re-encryption
Hybrid Zero-Knowledge from Garbled Circuits and Circuit-Based Composition of Σ-Protocols
Related-Key Attacks on the Full-Round Cobra-F64a and Cobra-F64b
Theory and Practice of Multiparty Computation
Proof-Carrying Proxy Certificates
Mix-Nets from Re-randomizable and Replayable CCA-Secure Public-Key Encryption
Statistics on Password Re-use and Adaptive Strength for Financial Accounts
Security and Cryptography for Networks - 14th International Conference, SCN 2024, Amalfi, Italy, September 11-13, 2024, Proceedings, Part II
Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
Storage Encryption: A Cryptographer's View
On the Classification of Finite Boolean Functions up to Fairness
Generalized RC4 Key Collisions and Hash Collisions
Expressive Subgroup Signatures
Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
A Provably Secure, Lightweight Protocol for Anonymous Authentication
Publicly Evaluable Pseudorandom Functions and Their Applications
Efficient Signatures on Randomizable Ciphertexts
Privacy Preserving Data Mining within Anonymous Credential Systems
A Robust Multisignatures Scheme with Applications to Acknowledgment Aggregation
On a Resynchronization Weakness in a Class of Combiners with Memory
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Simulation-Based Receiver Selective Opening CCA Secure PKE from Standard Computational Assumptions
Intrusion-Resilient Signatures: Generic Constructions, or Defeating Strong Adversary with Minimal Assumptions
On Access Control Encryption Without Sanitization
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
Security Model for Authenticated Key Exchange, Reconsidered
An Improved Robust Fuzzy Extractor
Exponential Quantum One-Wayness and EFI Pairs
Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption
Interactive Encryption and Message Authentication
Forward Secure Non-Interactive Key Exchange
On Adaptive Security of Delayed-Input Sigma Protocols and Fiat-Shamir NIZKs
Immunising CBC Mode Against Padding Oracle Attacks: A Formal Security Treatment
Proactive Secret Sharing with a Dishonest Majority
Impossible Differential Cryptanalysis of the Raindrop Block Cipher
Key-Policy ABE with Switchable Attributes
An Improved LPN Algorithm
About the Security of MTI/C0 and MQV
How to Repair ESIGN
Security Definitions for Hash Functions: Combining UCE and Indifferentiability
Group Signatures: Better Efficiency and New Theoretical Aspects
Distributed Private-Key Generators for Identity-Based Cryptography
Indifferentiability of 3-Round Confusion-Diffusion Networks
Cryptanalysis of Rainbow
Quantum Demiric-Selçuk Meet-in-the-Middle Attacks: Applications to 6-Round Generic Feistel Constructions
Weak Forward Security in Mediated RSA
Cryptanalysis of EagleSign
Non-trivial Witness Encryption and Null-iO from Standard Assumptions
On Adaptively Secure Multiparty Computation with a Short CRS
How (Not) to Instantiate Ring-LWE
Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWR
Universally Composable Simultaneous Broadcast
Searching Keywords with Wildcards on Encrypted Data
Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers
Efficient Re-keying Protocols for Multicast Encryption
Concurrent Blind Signatures Without Random Oracles
EyeDecrypt - Private Interactions in Plain Sight
Efficiency Limitations of Σ-Protocols for Group Homomorphisms Revisited
Cryptographic Divergences: New Techniques and New Applications
Constructing Strong KEM from Weak KEM (or How to Revive the KEM/DEM Framework)
Security and Cryptography for Networks - 14th International Conference, SCN 2024, Amalfi, Italy, September 11-13, 2024, Proceedings, Part I
A Simple and Efficient CCA-Secure Lattice KEM in the Standard Model
Efficient NIZK Arguments via Parallel Verification of Benes Networks
Simplified Submission of Inputs to Protocols
Expressive Attribute-Based Encryption with Constant-Size Ciphertexts from the Decisional Linear Assumption
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants
Efficient Blind Signatures Without Random Oracles
The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs
Leakage-Resilient Storage
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
Secure Key Exchange and Sessions without Credentials
Edge Eavesdropping Games
The Decimated Sample Based Improved Algebraic Attacks on the Nonlinear Filters
Colored Visual Cryptography Without Color Darkening
Threshold Cryptography for Mobile Ad Hoc Networks
On Statistical Testing of Random Numbers Generators
Improved Privacy of the Tree-Based Hash Protocols Using Physically Unclonable Function
Improving Practical UC-Secure Commitments Based on the DDH Assumption
Cumulatively All-Lossy-But-One Trapdoor Functions from Standard Assumptions
zk-Bench: A Toolset for Comparative Evaluation and Performance Benchmarking of SNARKs
LaPSuS - A Lattice-Based Private Stream Aggregation Scheme Under Scrutiny
OAE-RUP: A Strong Online AEAD Security Notion and Its Application to SAEF
A New Hash-and-Sign Approach and Structure-Preserving Signatures from DLIN
On Session Identifiers in Provably Secure Protocols: The Bellare-Rogaway Three-Party Key Distribution Protocol Revisited
Scalable Agreement Protocols with Optimal Optimistic Efficiency
Black-Box Constructions of Bounded-Concurrent Secure Computation
Kleptography from Standard Assumptions and Applications
A Constructive Perspective on Signcryption Security
Key-and-Argument-Updatable QA-NIZKs
Hash Combiners for Second Pre-image Resistance, Target Collision Resistance and Pre-image Resistance Have Long Output
Prio+: Privacy Preserving Aggregate Statistics via Boolean Shares
Differential Fault Analysis of LEX
Tight Verifiable Delay Functions
Decoding McEliece with a Hint - Secret Goppa Key Parts Reveal Everything
Efficient Protocols for Oblivious Linear Function Evaluation from Ring-LWE
Universally Composable Security with Local Adversaries
Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filters
Publicly Verifiable Ciphertexts
Medical Information Privacy Assurance: Cryptographic and System Aspects
Matrioska: A Compiler for Multi-key Homomorphic Signatures
5PM: Secure Pattern Matching
An Algebraic Approach to NTRU (q = 2n) via Witt Vectors and Overdetermined Systems of Nonlinear Equations
Identity-Based Zero Knowledge
Trading Players for Efficiency in Unconditional Multiparty Computation
Function-Revealing Encryption - Definitions and Constructions
Round Efficient Byzantine Agreement from VDFs
Compact Round-Optimal Partially-Blind Signatures
Approximate Distance-Comparison-Preserving Symmetric Encryption
Security and Cryptography for Networks - 12th International Conference, SCN 2020, Amalfi, Italy, September 14-16, 2020, Proceedings
Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions
Higher-Order Masked Saber
Constant-Size Dynamic k -TAA
Mystrium: Wide Block Encryption Efficient on Entry-Level Processors
Security and Cryptography for Networks - 10th International Conference, SCN 2016, Amalfi, Italy, August 31 - September 2, 2016, Proceedings
Universal Vector Commitments
Two Generic Constructions of Probabilistic Cryptosystems and Their Applications
Efficient Network-Based Enforcement of Data Access Rights
Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions
Estimate All the {LWE, NTRU} Schemes!
Security and Cryptography for Networks - 11th International Conference, SCN 2018, Amalfi, Italy, September 5-7, 2018, Proceedings
The Round Complexity of Secure Computation Against Covert Adversaries
Shared-Custodial Password-Authenticated Deterministic Wallets
History-Free Aggregate Message Authentication Codes
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages
Universal Designated Verifier Signatures Without Random Oracles or Non-black Box Assumptions
Improved Primitives for Secure Multiparty Integer Computation
Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys
On Sufficient Oracles for Secure Computation with Identifiable Abort
Using Normal Bases for Compact Hardware Implementations of the AES S-Box
Relaxed Two-to-One Recoding Schemes
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One
Threshold Attribute-Based Signcryption
Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups
On the Size of Monotone Span Programs
Generic Attacks on Strengthened HMAC: n-bit Secure HMAC Requires Key in All Blocks
Fully Anonymous Group Signature with Verifier-Local Revocation
Efficient Proofs of Secure Erasure
Human Perfectly Secure Message Transmission Protocols and Their Applications