Abstract is missing.
- Differential PrivacyCynthia Dwork. 1-12 [doi]
- The One Way to Quantum ComputationVincent Danos, Elham Kashefi, Prakash Panangaden. 13-21 [doi]
- Efficient Zero Knowledge on the InternetIvan Visconti. 22-33 [doi]
- Independent Zero-Knowledge SetsRosario Gennaro, Silvio Micali. 34-45 [doi]
- An Efficient Compiler from ::::Sigma::::-Protocol to 2-Move Deniable Zero-KnowledgeJun Furukawa, Kaoru Kurosawa, Hideki Imai. 46-57 [doi]
- New Extensions of Pairing-Based Signatures into Universal Designated Verifier SignaturesDamien Vergnaud. 58-69 [doi]
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast EncryptionDaniele Micciancio, Saurabh Panjwani. 70-82 [doi]
- Cryptographically Sound Implementations for Communicating ProcessesPedro Adão, Cédric Fournet. 83-94 [doi]
- A Dolev-Yao-Based Definition of Abuse-Free ProtocolsDetlef Kähler, Ralf Küsters, Thomas Wilke. 95-106 [doi]
- Preserving Secrecy Under RefinementRajeev Alur, Pavol Cerný, Steve Zdancewic. 107-118 [doi]
- Quantifying Information Leakage in Process CalculiMichele Boreale. 119-131 [doi]
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and ::::Exclusive Or::::Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen. 132-143 [doi]
- Generalized Compact Knapsacks Are Collision ResistantVadim Lyubashevsky, Daniele Micciancio. 144-155 [doi]
- An Efficient Provable Distinguisher for HFEVivien Dubois, Louis Granboulan, Jacques Stern. 156-167 [doi]
- A Tight Bound for EMACKrzysztof Pietrzak. 168-179 [doi]
- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic ImmunityFrederik Armknecht, Matthias Krause. 180-191 [doi]
- On Everlasting Security in the ::::Hybrid:::: Bounded Storage ModelDanny Harnik, Moni Naor. 192-203 [doi]
- On the Impossibility of Extracting Classical Randomness Using a Quantum ComputerYevgeniy Dodis, Renato Renner. 204-215 [doi]
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List DecodingAkinori Kawachi, Tomoyuki Yamakami. 216-227 [doi]
- Efficient Pseudorandom Generators from Exponentially Hard One-Way FunctionsIftach Haitner, Danny Harnik, Omer Reingold. 228-239 [doi]
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman SchemesPierre-Alain Fouque, David Pointcheval, Jacques Stern, Sébastien Zimmer. 240-251 [doi]
- A Probabilistic Hoare-style Logic for Game-Based Cryptographic ProofsRicardo Corin, Jerry den Hartog. 252-263 [doi]
- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-TraceabilityDuong Hieu Phan, Reihaneh Safavi-Naini, Dongvu Tonien. 264-275 [doi]
- An Adaptively Secure Mix-Net Without ErasuresDouglas Wikström, Jens Groth. 276-287 [doi]
- Multipartite Secret Sharing by Bivariate InterpolationTamir Tassa, Nira Dyn. 288-299 [doi]
- Identity-Based Encryption Gone WildMichel Abdalla, Dario Catalano, Alexander W. Dent, John Malone-Lee, Gregory Neven, Nigel P. Smart. 300-311 [doi]
- Deterministic Priority Mean-Payoff Games as Limits of Discounted GamesHugo Gimbert, Wieslaw Zielonka. 312-323 [doi]
- Recursive Concurrent Stochastic GamesKousha Etessami, Mihalis Yannakakis. 324-335 [doi]
- Half-Positional Determinacy of Infinite GamesEryk Kopczynski. 336-347 [doi]
- A Game-Theoretic Approach to Deciding Higher-Order MatchingColin Stirling. 348-359 [doi]
- Descriptive and Relative Completeness of Logics for Higher-Order FunctionsKohei Honda, Martin Berger, Nobuko Yoshida. 360-371 [doi]
- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric PolymorphismRasmus Ejlers Møgelberg. 372-383 [doi]
- Typed GoI for ExponentialsEsfandiar Haghverdi. 384-395 [doi]
- Commutative Locative Quantifiers for Multiplicative Linear LogicStefano Guerrini, Patrizia Marzuoli. 396-407 [doi]
- The Wadge Hierarchy of Deterministic Tree LanguagesFilip Murlak. 408-419 [doi]
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno SequencesPatricia Bouyer, Serge Haddad, Pierre-Alain Reynier. 420-431 [doi]
- On Complexity of Grammars Related to the Safety ProblemTomasz Jurdzinski. 432-443 [doi]
- Jumbo ::::lambda::::-CalculusPaul Blain Levy. 444-455 [doi]
- ::::lambda::::-RBAC: Programming with Role-Based Access ControlRadha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely. 456-467 [doi]
- Communication of Two Stacks and RewritingJuhani Karhumäki, Michal Kunc, Alexander Okhotin. 468-479 [doi]
- On the Axiomatizability of PriorityLuca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir. 480-491 [doi]
- A Finite Equational Base for CCS with Left Merge and Communication MergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. 492-503 [doi]
- Theories of HNN-Extensions and Amalgamated ProductsMarkus Lohrey, Géraud Sénizergues. 504-515 [doi]
- On Intersection Problems for Polynomially Generated SetsWong Karianto, Aloys Krieg, Wolfgang Thomas. 516-527 [doi]
- Invisible Safety of Distributed ProtocolsIttai Balaban, Amir Pnueli, Lenore D. Zuck. 528-539 [doi]
- The Complexity of Enriched ::::µ::::-CalculiPiero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi. 540-551 [doi]
- Interpreting Tree-to-Tree QueriesMichael Benedikt, Christoph Koch. 552-564 [doi]
- Constructing Exponential-Size Deterministic Zielonka AutomataBlaise Genest, Anca Muscholl. 565-576 [doi]
- Flat Parametric Counter AutomataMarius Bozga, Radu Iosif, Yassine Lakhnech. 577-588 [doi]
- Lower Bounds for Complementation of ::::omega::::-Automata Via the Full Automata TechniqueQiqi Yan. 589-600 [doi]