Abstract is missing.
- Composable Formal Security Analysis: Juggling Soundness, Simplicity and EfficiencyRan Canetti. 1-13 [doi]
- Newton s Method for omega-Continuous SemiringsJavier Esparza, Stefan Kiefer, Michael Luttenberger. 14-26 [doi]
- The Tractability Frontier for NFA MinimizationHenrik Björklund, Wim Martens. 27-38 [doi]
- Finite Automata, Digraph Connectivity, and Regular Expression SizeHermann Gruber, Markus Holzer. 39-50 [doi]
- Leftist Grammars Are Non-primitive RecursiveTomasz Jurdzinski. 51-62 [doi]
- On the Computational Completeness of Equations over Sets of Natural NumbersArtur Jez, Alexander Okhotin. 63-74 [doi]
- Placement Inference for a Client-Server CalculusMatthias Neubauer, Peter Thiemann. 75-86 [doi]
- Extended pi-CalculiMagnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson. 87-98 [doi]
- Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile ProcessesMartin Berger, Kohei Honda, Nobuko Yoshida. 99-111 [doi]
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple BasesBernard Boigelot, Julien Brusten, Véronique Bruyère. 112-123 [doi]
- On Expressiveness and Complexity in Real-Time Model CheckingPatricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell. 124-135 [doi]
- STORMED Hybrid SystemsVladimeros Vladimerou, Pavithra Prabhakar, Mahesh Viswanathan, Geir E. Dullerud. 136-147 [doi]
- Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time ObjectivesTomás Brázdil, Vojtech Forejt, Antonín Kucera. 148-159 [doi]
- On Datalog vs. LFPAnuj Dawar, Stephan Kreutzer. 160-171 [doi]
- Directed st-Connectivity Is Not Expressible in Symmetric DatalogLászló Egri, Benoit Larose, Pascal Tesson. 172-183 [doi]
- Non-dichotomies in Constraint Satisfaction ComplexityManuel Bodirsky, Martin Grohe. 184-196 [doi]
- Quantified Constraint Satisfaction and the Polynomially Generated Powers PropertyHubie Chen. 197-208 [doi]
- When Does Partial Commutative Closure Preserve Regularity?Antonio Cano Gómez, Giovanna Guaiana, Jean-Eric Pin. 209-220 [doi]
- Weighted Logics for Nested Words and Algebraic Formal Power SeriesChristian Mathissen. 221-232 [doi]
- Tree Languages Defined in First-Order Logic with One Quantifier AlternationMikolaj Bojanczyk, Luc Segoufin. 233-245 [doi]
- Duality and Equational Theory of Regular LanguagesMai Gehrke, Serge Grigorieff, Jean-Eric Pin. 246-257 [doi]
- Reversible Flowchart Languages and the Structured Reversible Program TheoremTetsuo Yokoyama, Holger Bock Axelsen, Robert Glück. 258-270 [doi]
- Attribute Grammars and Categorical SemanticsShin-ya Katsumata. 271-282 [doi]
- A Domain Theoretic Model of Qubit ChannelsKeye Martin. 283-297 [doi]
- Interacting Quantum ObservablesBob Coecke, Ross Duncan. 298-310 [doi]
- Perpetuality for Full and Safe Composition (in a Constructive Setting)Delia Kesner. 311-322 [doi]
- A System F with Call-by-Name ExceptionsSylvain Lebresne. 323-335 [doi]
- Linear Logical AlgorithmsRobert J. Simmons, Frank Pfenning. 336-347 [doi]
- A Simple Model of Separation Logic for Higher-Order StoreLars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang. 348-360 [doi]
- Open ImplicationKarin Greimel, Roderick Bloem, Barbara Jobstmann, Moshe Y. Vardi. 361-372 [doi]
- ATL* Satisfiability Is 2EXPTIME-CompleteSven Schewe. 373-385 [doi]
- Visibly Pushdown TransducersJean-François Raskin, Frédéric Servais. 386-397 [doi]
- The Non-deterministic Mostowski Hierarchy and Distance-Parity AutomataThomas Colcombet, Christof Löding. 398-409 [doi]
- Analyzing Context-Free Grammars Using an Incremental SAT SolverRoland Axelsson, Keijo Heljanko, Martin Lange. 410-422 [doi]
- Weak Pseudorandom Functions in MinicryptKrzysztof Pietrzak, Johan Sjödin. 423-436 [doi]
- On Black-Box Ring Extraction and Integer FactorizationKristina Altmann, Tibor Jager, Andy Rupp. 437-448 [doi]
- Extractable Perfectly One-Way FunctionsRan Canetti, Ronny Ramzi Dakdouk. 449-460 [doi]
- Error-Tolerant Combiners for Oblivious PrimitivesBartosz Przydatek, Jürg Wullschleger. 461-472 [doi]
- Asynchronous Multi-Party Computation with Quadratic CommunicationMartin Hirt, Jesper Buus Nielsen, Bartosz Przydatek. 473-485 [doi]
- Improved Garbled Circuit: Free XOR Gates and ApplicationsVladimir Kolesnikov, Thomas Schneider. 486-498 [doi]
- Improving the Round Complexity of VSS in Point-to-Point NetworksJonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan. 499-510 [doi]
- How to Protect Yourself without Perfect ShreddingRan Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim. 511-523 [doi]
- Universally Composable Undeniable SignatureKaoru Kurosawa, Jun Furukawa. 524-535 [doi]
- Interactive PCPYael Tauman Kalai, Ran Raz. 536-547 [doi]
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key ModelRafail Ostrovsky, Giuseppe Persiano, Ivan Visconti. 548-559 [doi]
- Delegating Capabilities in Predicate Encryption SystemsElaine Shi, Brent Waters. 560-578 [doi]
- Bounded Ciphertext Policy Attribute Based EncryptionVipul Goyal, Abhishek Jain 0002, Omkant Pandey, Amit Sahai. 579-591 [doi]
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum AttacksSean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang. 592-603 [doi]
- Composable Security in the Bounded-Quantum-Storage ModelStephanie Wehner, Jürg Wullschleger. 604-615 [doi]
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are WeakJonathan J. Hoch, Adi Shamir. 616-630 [doi]
- History-Independent Cuckoo HashingMoni Naor, Gil Segev, Udi Wieder. 631-642 [doi]
- Building a Collision-Resistant Compression Function from Non-compressing PrimitivesThomas Shrimpton, Martijn Stam. 643-654 [doi]
- Robust Multi-property Combiners for Hash Functions RevisitedMarc Fischlin, Anja Lehmann, Krzysztof Pietrzak. 655-666 [doi]
- Homomorphic Encryption with CCA SecurityManoj Prabhakaran, Mike Rosulek. 667-678 [doi]
- How to Encrypt with the LPN ProblemHenri Gilbert, Matthew J. B. Robshaw, Yannick Seurin. 679-690 [doi]
- Could SFLASH be Repaired?Jintai Ding, Vivien Dubois, Bo-Yin Yang, Chia-Hsin Owen Chen, Chen-Mou Cheng. 691-701 [doi]
- Password Mistyping in Two-Factor-Authenticated Key ExchangeVladimir Kolesnikov, Charles Rackoff. 702-714 [doi]
- Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple CredentialsStanislaw Jarecki, Xiaomin Liu. 715-726 [doi]