You have Guest access.
Log In
Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir and Igor Walukiewicz
Front matter
1-13
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency
14-26
Newton’s Method for ω-Continuous Semirings
27-38
The Tractability Frontier for NFA Minimization
39-50
Finite Automata, Digraph Connectivity, and Regular Expression Size (Extended Abstract)
51-62
Leftist Grammars Are Non-primitive Recursive
63-74
On the Computational Completeness of Equations over Sets of Natural Numbers
75-86
Placement Inference for a Client-Server Calculus
87-98
Extended pi-Calculi
99-111
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
112-123
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
124-135
On Expressiveness and Complexity in Real-Time Model Checking
136-147
STORMED Hybrid Systems
148-159
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
160-171
On Datalog vs. LFP
172-183
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
184-196
Non-dichotomies in Constraint Satisfaction Complexity
197-208
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Extended Abstract)
209-220
When Does Partial Commutative Closure Preserve Regularity?
221-232
Weighted Logics for Nested Words and Algebraic Formal Power Series
233-245
Tree Languages Defined in First-Order Logic with One Quantifier Alternation
246-257
Duality and Equational Theory of Regular Languages
258-270
Reversible Flowchart Languages and the Structured Reversible Program Theorem
271-282
Attribute Grammars and Categorical Semantics
283-297
A Domain Theoretic Model of Qubit Channels
298-310
Interacting Quantum Observables
311-322
Perpetuality for Full and Safe Composition (in a Constructive Setting)
323-335
A System F with Call-by-Name Exceptions
336-347
Linear Logical Algorithms
348-360
A Simple Model of Separation Logic for Higher-Order Store
361-372
Open Implication
373-385
ATL* Satisfiability Is 2EXPTIME-Complete
386-397
Visibly Pushdown Transducers
398-409
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata
410-422
Analyzing Context-Free Grammars Using an Incremental SAT Solver
423-436
Weak Pseudorandom Functions in Minicrypt
437-448
On Black-Box Ring Extraction and Integer Factorization
449-460
Extractable Perfectly One-Way Functions
461-472
Error-Tolerant Combiners for Oblivious Primitives
473-485
Asynchronous Multi-Party Computation with Quadratic Communication
486-498
Improved Garbled Circuit: Free XOR Gates and Applications
499-510
Improving the Round Complexity of VSS in Point-to-Point Networks
511-523
How to Protect Yourself without Perfect Shredding
524-535
Universally Composable Undeniable Signature
536-547
Interactive PCP
548-559
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
560-578
Delegating Capabilities in Predicate Encryption Systems
579-591
Bounded Ciphertext Policy Attribute Based Encryption
592-603
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks
604-615
Composable Security in the Bounded-Quantum-Storage Model
616-630
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak
631-642
History-Independent Cuckoo Hashing
643-654
Building a Collision-Resistant Compression Function from Non-compressing Primitives (Extended Abstract)
655-666
Robust Multi-property Combiners for Hash Functions Revisited
667-678
Homomorphic Encryption with CCA Security
679-690
How to Encrypt with the LPN Problem
691-701
Could SFLASH be Repaired?
702-714
Password Mistyping in Two-Factor-Authenticated Key Exchange
715-726
Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info