Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID35th ICALP 2008: Reykjavik, Iceland - Part II
- Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson
, Anna Ingólfsdóttir, Igor Walukiewicz:
Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations. Lecture Notes in Computer Science 5126, Springer 2008, ISBN 978-3-540-70582-6
Invited Lectures
- Ran Canetti:
Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency. 1-13 - Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Newton's Method for omega-Continuous Semirings. 14-26
Track B: Logic, Semantics, and Theory of Programming
Bounds
- Henrik Björklund, Wim Martens:
The Tractability Frontier for NFA Minimization. 27-38 - Hermann Gruber, Markus Holzer:
Finite Automata, Digraph Connectivity, and Regular Expression Size. 39-50 - Tomasz Jurdzinski:
Leftist Grammars Are Non-primitive Recursive. 51-62 - Artur Jez, Alexander Okhotin:
On the Computational Completeness of Equations over Sets of Natural Numbers. 63-74
Distributed Computation
- Matthias Neubauer, Peter Thiemann:
Placement Inference for a Client-Server Calculus. 75-86 - Magnus Johansson, Joachim Parrow, Björn Victor, Jesper Bengtson:
Extended pi-Calculi. 87-98 - Martin Berger, Kohei Honda, Nobuko Yoshida:
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes. 99-111
Real-Time and Probabilistic Systems
- Bernard Boigelot, Julien Brusten, Véronique Bruyère:
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. 112-123 - Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
On Expressiveness and Complexity in Real-Time Model Checking. 124-135 - Vladimeros Vladimerou, Pavithra Prabhakar, Mahesh Viswanathan, Geir E. Dullerud:
STORMED Hybrid Systems. 136-147 - Tomás Brázdil, Vojtech Forejt, Antonín Kucera:
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. 148-159
Logic and Complexity
- Anuj Dawar, Stephan Kreutzer:
On Datalog vs. LFP. 160-171 - László Egri, Benoît Larose, Pascal Tesson:
Directed st-Connectivity Is Not Expressible in Symmetric Datalog. 172-183 - Manuel Bodirsky, Martin Grohe:
Non-dichotomies in Constraint Satisfaction Complexity. 184-196 - Hubie Chen:
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. 197-208
Words and Trees
- Antonio Cano Gómez, Giovanna Guaiana, Jean-Eric Pin:
When Does Partial Commutative Closure Preserve Regularity? 209-220 - Christian Mathissen:
Weighted Logics for Nested Words and Algebraic Formal Power Series. 221-232 - Mikolaj Bojanczyk, Luc Segoufin:
Tree Languages Defined in First-Order Logic with One Quantifier Alternation. 233-245 - Mai Gehrke, Serge Grigorieff, Jean-Eric Pin:
Duality and Equational Theory of Regular Languages. 246-257
Nonstandard Models of Computation
- Tetsuo Yokoyama, Holger Bock Axelsen, Robert Glück:
Reversible Flowchart Languages and the Structured Reversible Program Theorem. 258-270 - Shin-ya Katsumata:
Attribute Grammars and Categorical Semantics. 271-282 - Keye Martin:
A Domain Theoretic Model of Qubit Channels. 283-297 - Bob Coecke, Ross Duncan:
Interacting Quantum Observables. 298-310
Reasoning about Computation
- Delia Kesner:
Perpetuality for Full and Safe Composition (in a Constructive Setting). 311-322 - Sylvain Lebresne:
A System F with Call-by-Name Exceptions. 323-335 - Robert J. Simmons, Frank Pfenning:
Linear Logical Algorithms. 336-347 - Lars Birkedal, Bernhard Reus, Jan Schwinghammer, Hongseok Yang:
A Simple Model of Separation Logic for Higher-Order Store. 348-360
Verification
- Karin Greimel, Roderick Bloem, Barbara Jobstmann, Moshe Y. Vardi:
Open Implication. 361-372 - Sven Schewe:
ATL* Satisfiability Is 2EXPTIME-Complete. 373-385 - Jean-François Raskin, Frédéric Servais:
Visibly Pushdown Transducers. 386-397 - Thomas Colcombet, Christof Löding:
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. 398-409 - Roland Axelsson, Keijo Heljanko, Martin Lange:
Analyzing Context-Free Grammars Using an Incremental SAT Solver. 410-422
Track C: Security and Cryptography Foundations
Theory
- Krzysztof Pietrzak, Johan Sjödin:
Weak Pseudorandom Functions in Minicrypt. 423-436 - Kristina Altmann, Tibor Jager, Andy Rupp:
On Black-Box Ring Extraction and Integer Factorization. 437-448 - Ran Canetti, Ronny Ramzi Dakdouk:
Extractable Perfectly One-Way Functions. 449-460 - Bartosz Przydatek, Jürg Wullschleger:
Error-Tolerant Combiners for Oblivious Primitives. 461-472
Secure Computation
- Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek:
Asynchronous Multi-Party Computation with Quadratic Communication. 473-485 - Vladimir Kolesnikov, Thomas Schneider:
Improved Garbled Circuit: Free XOR Gates and Applications. 486-498 - Jonathan Katz, Chiu-Yuen Koo, Ranjit Kumaresan:
Improving the Round Complexity of VSS in Point-to-Point Networks. 499-510 - Ran Canetti, Dror Eiger, Shafi Goldwasser, Dah-Yoh Lim:
How to Protect Yourself without Perfect Shredding. 511-523
Two-Party Protocols and Zero-Knowledge
- Kaoru Kurosawa, Jun Furukawa:
Universally Composable Undeniable Signature. 524-535 - Yael Tauman Kalai, Ran Raz:
Interactive PCP. 536-547 - Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. 548-559
Encryption with Special Properties/Quantum Cryptography
- Elaine Shi, Brent Waters:
Delegating Capabilities in Predicate Encryption Systems. 560-578 - Vipul Goyal, Abhishek Jain, Omkant Pandey, Amit Sahai:
Bounded Ciphertext Policy Attribute Based Encryption. 579-591 - Sean Hallgren, Alexandra Kolla, Pranab Sen, Shengyu Zhang:
Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. 592-603 - Stephanie Wehner, Jürg Wullschleger:
Composable Security in the Bounded-Quantum-Storage Model. 604-615
Various Types of Hashing
- Jonathan J. Hoch, Adi Shamir:
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak. 616-630 - Moni Naor, Gil Segev, Udi Wieder:
History-Independent Cuckoo Hashing. 631-642 - Thomas Shrimpton, Martijn Stam:
Building a Collision-Resistant Compression Function from Non-compressing Primitives. 643-654 - Marc Fischlin, Anja Lehmann, Krzysztof Pietrzak:
Robust Multi-property Combiners for Hash Functions Revisited. 655-666
Public-Key Cryptography/Authentication
- Manoj Prabhakaran, Mike Rosulek:
Homomorphic Encryption with CCA Security. 667-678 - Henri Gilbert, Matthew J. B. Robshaw, Yannick Seurin:
How to Encrypt with the LPN Problem. 679-690 - Jintai Ding, Vivien Dubois, Bo-Yin Yang, Chia-Hsin Owen Chen, Chen-Mou Cheng:
Could SFLASH be Repaired?. 691-701 - Vladimir Kolesnikov, Charles Rackoff:
Password Mistyping in Two-Factor-Authenticated Key Exchange. 702-714 - Stanislaw Jarecki, Xiaomin Liu:
Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials. 715-726
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-19 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
