default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd ICALP 2006: Venice, Italy
- Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener:
Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II. Lecture Notes in Computer Science 4052, Springer 2006, ISBN 3-540-35907-9
Invited Papers
- Cynthia Dwork:
Differential Privacy. 1-12 - Vincent Danos, Elham Kashefi, Prakash Panangaden:
The One Way to Quantum Computation. 13-21
Zero-Knowledge and Signatures
- Ivan Visconti:
Efficient Zero Knowledge on the Internet. 22-33 - Rosario Gennaro, Silvio Micali:
Independent Zero-Knowledge Sets. 34-45 - Jun Furukawa, Kaoru Kurosawa, Hideki Imai:
An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge. 46-57 - Damien Vergnaud
:
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures. 58-69
Cryptographic Protocols
- Daniele Micciancio, Saurabh Panjwani:
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption. 70-82 - Pedro Adão, Cédric Fournet:
Cryptographically Sound Implementations for Communicating Processes. 83-94 - Detlef Kähler, Ralf Küsters, Thomas Wilke:
A Dolev-Yao-Based Definition of Abuse-Free Protocols. 95-106
Secrecy and Protocol Analysis
- Rajeev Alur, Pavol Cerný, Steve Zdancewic:
Preserving Secrecy Under Refinement. 107-118 - Michele Boreale:
Quantifying Information Leakage in Process Calculi. 119-131 - Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen:
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. 132-143
Cryptographic Primitives
- Vadim Lyubashevsky, Daniele Micciancio:
Generalized Compact Knapsacks Are Collision Resistant. 144-155 - Vivien Dubois, Louis Granboulan, Jacques Stern:
An Efficient Provable Distinguisher for HFE. 156-167 - Krzysztof Pietrzak:
A Tight Bound for EMAC. 168-179 - Frederik Armknecht, Matthias Krause:
Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity. 180-191
Bounded Storage and Quantum Models
- Danny Harnik, Moni Naor:
On Everlasting Security in the Hybrid Bounded Storage Model. 192-203 - Yevgeniy Dodis, Renato Renner:
On the Impossibility of Extracting Classical Randomness Using a Quantum Computer. 204-215 - Akinori Kawachi, Tomoyuki Yamakami:
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding. 216-227
Foundations
- Iftach Haitner, Danny Harnik, Omer Reingold:
Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. 228-239 - Pierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer:
Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes. 240-251 - Ricardo Corin, Jerry den Hartog:
A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs. 252-263
Multi-party Protocols
- Duong Hieu Phan, Reihaneh Safavi-Naini, Dongvu Tonien:
Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability. 264-275 - Douglas Wikström, Jens Groth:
An Adaptively Secure Mix-Net Without Erasures. 276-287 - Tamir Tassa, Nira Dyn:
Multipartite Secret Sharing by Bivariate Interpolation. 288-299 - Michel Abdalla, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Nigel P. Smart:
Identity-Based Encryption Gone Wild. 300-311
Games
- Hugo Gimbert, Wieslaw Zielonka:
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games. 312-323 - Kousha Etessami, Mihalis Yannakakis:
Recursive Concurrent Stochastic Games. 324-335 - Eryk Kopczynski:
Half-Positional Determinacy of Infinite Games. 336-347 - Colin Stirling:
A Game-Theoretic Approach to Deciding Higher-Order Matching. 348-359
Semantics
- Kohei Honda, Martin Berger, Nobuko Yoshida:
Descriptive and Relative Completeness of Logics for Higher-Order Functions. 360-371 - Rasmus Ejlers Møgelberg:
Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism. 372-383 - Esfandiar Haghverdi:
Typed GoI for Exponentials. 384-395 - Stefano Guerrini, Patrizia Marzuoli:
Commutative Locative Quantifiers for Multiplicative Linear Logic. 396-407
Automata I
- Filip Murlak:
The Wadge Hierarchy of Deterministic Tree Languages. 408-419 - Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier:
Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences. 420-431 - Tomasz Jurdzinski:
On Complexity of Grammars Related to the Safety Problem. 432-443
Models
- Paul Blain Levy:
Jumbo lambda-Calculus. 444-455 - Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
lambda-RBAC: Programming with Role-Based Access Control. 456-467 - Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Communication of Two Stacks and Rewriting. 468-479
Equations
- Luca Aceto, Taolue Chen, Wan J. Fokkink, Anna Ingólfsdóttir:
On the Axiomatizability of Priority. 480-491 - Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge. 492-503 - Markus Lohrey, Géraud Sénizergues:
Theories of HNN-Extensions and Amalgamated Products. 504-515 - Karianto Wong, Aloys Krieg, Wolfgang Thomas:
On Intersection Problems for Polynomially Generated Sets. 516-527
Logics
- Ittai Balaban, Amir Pnueli, Lenore D. Zuck:
Invisible Safety of Distributed Protocols. 528-539 - Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi:
The Complexity of Enriched µ-Calculi. 540-551 - Michael Benedikt, Christoph Koch:
Interpreting Tree-to-Tree Queries. 552-564
Automata II
- Blaise Genest, Anca Muscholl:
Constructing Exponential-Size Deterministic Zielonka Automata. 565-576 - Marius Bozga, Radu Iosif, Yassine Lakhnech:
Flat Parametric Counter Automata. 577-588 - Qiqi Yan:
Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique. 589-600
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 2025-12-04 22:07 CET 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:
