Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II

  • Conference proceedings
  • © 2006

Overview

Editors:
  1. Michele Bugliesi

    1. Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bart Preneel

    1. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Vladimiro Sassone

    1. ECS, University of Southampton, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ingo Wegener

    1. FB Informatik, LS2, Univ. Dortmund, Dortmund, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4052)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICALP 2006.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (50 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Papers

    1. Differential Privacy

      • Cynthia Dwork
      Pages 1-12

    2. The One Way to Quantum Computation

      • Vincent Danos, Elham Kashefi, Prakash Panangaden
      Pages 13-21

  3. Zero-Knowledge and Signatures

    1. Efficient Zero Knowledge on the Internet

      • Ivan Visconti
      Pages 22-33

    2. Independent Zero-Knowledge Sets

      • Rosario Gennaro, Silvio Micali
      Pages 34-45

    3. An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge

      • Jun Furukawa, Kaoru Kurosawa, Hideki Imai
      Pages 46-57

    4. New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures

      • Damien Vergnaud
      Pages 58-69

  4. Cryptographic Protocols

    1. Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption

      • Daniele Micciancio, Saurabh Panjwani
      Pages 70-82

    2. Cryptographically Sound Implementations for Communicating Processes

      • Pedro Adão, Cédric Fournet
      Pages 83-94

    3. A Dolev-Yao-Based Definition of Abuse-Free Protocols

      • Detlef Kähler, Ralf Küsters, Thomas Wilke
      Pages 95-106

  5. Secrecy and Protocol Analysis

    1. Preserving Secrecy Under Refinement

      • Rajeev Alur, Pavol Černý, Steve Zdancewic
      Pages 107-118

    2. Quantifying Information Leakage in Process Calculi

      • Michele Boreale
      Pages 119-131

    3. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or

      • Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
      Pages 132-143

  6. Cryptographic Primitives

    1. Generalized Compact Knapsacks Are Collision Resistant

      • Vadim Lyubashevsky, Daniele Micciancio
      Pages 144-155

    2. An Efficient Provable Distinguisher for HFE

      • Vivien Dubois, Louis Granboulan, Jacques Stern
      Pages 156-167

    3. A Tight Bound for EMAC

      • Krzysztof Pietrzak
      Pages 168-179

    4. Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity

      • Frederik Armknecht, Matthias Krause
      Pages 180-191

  7. Bounded Storage and Quantum Models

    1. On Everlasting Security in the Hybrid Bounded Storage Model

      • Danny Harnik, Moni Naor
      Pages 192-203

    2. On the Impossibility of Extracting Classical Randomness Using a Quantum Computer

      • Yevgeniy Dodis, Renato Renner
      Pages 204-215

    3. Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding

      • Akinori Kawachi, Tomoyuki Yamakami
      Pages 216-227
Back to top

Other volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Keywords

Editors and Affiliations

  • Dipartimento di Informatica, Università Ca’ Foscari, Venice,  

    Michele Bugliesi

  • Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  • ECS, University of Southampton, UK

    Vladimiro Sassone

  • FB Informatik, LS2, Univ. Dortmund, Dortmund, Germany

    Ingo Wegener

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation