Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener
Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, Part II
ICALP (2), 2006.
@proceedings{ICALP-v2-2006,
address = "Venice, Italy",
editor = "Michele Bugliesi and Bart Preneel and Vladimiro Sassone and Ingo Wegener",
isbn = "3-540-35907-9",
publisher = "{Springer International Publishing}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, Part II}",
volume = 4052,
year = 2006,
}
Contents (50 items)
- ICALP-v2-2006-Dwork #difference #privacy
- Differential Privacy (CD), pp. 1–12.
- ICALP-v2-2006-DanosKP #quantum
- The One Way to Quantum Computation (VD, EK, PP), pp. 13–21.
- ICALP-v2-2006-Visconti #internet #performance
- Efficient Zero Knowledge on the Internet (IV), pp. 22–33.
- ICALP-v2-2006-GennaroM #independence #set
- Independent Zero-Knowledge Sets (RG, SM), pp. 34–45.
- ICALP-v2-2006-FurukawaKI #compilation #performance
- An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge (JF, KK, HI), pp. 46–57.
- ICALP-v2-2006-Vergnaud #verification
- New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures (DV), pp. 58–69.
- ICALP-v2-2006-MicciancioP #encryption #multi
- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption (DM, SP), pp. 70–82.
- ICALP-v2-2006-AdaoF #communication #encryption #implementation #process
- Cryptographically Sound Implementations for Communicating Processes (PA, CF), pp. 83–94.
- ICALP-v2-2006-KahlerKW #protocol
- A Dolev-Yao-Based Definition of Abuse-Free Protocols (DK, RK, TW), pp. 95–106.
- ICALP-v2-2006-AlurCZ #refinement
- Preserving Secrecy Under Refinement (RA, PC, SZ), pp. 107–118.
- ICALP-v2-2006-Boreale #calculus #information management #process
- Quantifying Information Leakage in Process Calculi (MB), pp. 119–131.
- ICALP-v2-2006-DelauneLLT #analysis #morphism #protocol
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or (SD, PL, DL, RT), pp. 132–143.
- ICALP-v2-2006-LyubashevskyM
- Generalized Compact Knapsacks Are Collision Resistant (VL, DM), pp. 144–155.
- ICALP-v2-2006-DuboisGS #performance
- An Efficient Provable Distinguisher for HFE (VD, LG, JS), pp. 156–167.
- ICALP-v2-2006-Pietrzak #bound
- A Tight Bound for EMAC (KP), pp. 168–179.
- ICALP-v2-2006-ArmknechtK #algebra #multi
- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity (FA, MK), pp. 180–191.
- ICALP-v2-2006-HarnikN #bound #hybrid #on the #security
- On Everlasting Security in the Hybrid Bounded Storage Model (DH, MN), pp. 192–203.
- ICALP-v2-2006-DodisR #on the #quantum #using
- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.
- ICALP-v2-2006-KawachiY #quantum
- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (AK, TY), pp. 216–227.
- ICALP-v2-2006-HaitnerHR #generative #performance #pseudo
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (IH, DH, OR), pp. 228–239.
- ICALP-v2-2006-FouquePSZ
- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes (PAF, DP, JS, SZ), pp. 240–251.
- ICALP-v2-2006-CorinH #encryption #game studies #hoare #logic #probability #proving
- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs (RC, JdH), pp. 252–263.
- ICALP-v2-2006-PhanST #hybrid
- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability (DHP, RSN, DT), pp. 264–275.
- ICALP-v2-2006-WikstromG #adaptation
- An Adaptively Secure Mix-Net Without Erasures (DW, JG), pp. 276–287.
- ICALP-v2-2006-TassaD #multi
- Multipartite Secret Sharing by Bivariate Interpolation (TT, ND), pp. 288–299.
- ICALP-v2-2006-AbdallaCDMNS #encryption
- Identity-Based Encryption Gone Wild (MA, DC, AWD, JML, GN, NPS), pp. 300–311.
- ICALP-v2-2006-GimbertZ #game studies
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (HG, WZ), pp. 312–323.
- ICALP-v2-2006-EtessamiY #concurrent #game studies #probability #recursion
- Recursive Concurrent Stochastic Games (KE, MY), pp. 324–335.
- ICALP-v2-2006-Kopczynski #game studies #infinity
- Half-Positional Determinacy of Infinite Games (EK), pp. 336–347.
- ICALP-v2-2006-Stirling #approach #game studies #higher-order
- A Game-Theoretic Approach to Deciding Higher-Order Matching (CS), pp. 348–359.
- ICALP-v2-2006-HondaBY #higher-order #logic
- Descriptive and Relative Completeness of Logics for Higher-Order Functions (KH, MB, NY), pp. 360–371.
- ICALP-v2-2006-Mogelberg #formal method #modelling #morphism #parametricity #polymorphism
- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism (REM), pp. 372–383.
- ICALP-v2-2006-Haghverdi #exponential
- Typed GoI for Exponentials (EH), pp. 384–395.
- ICALP-v2-2006-GuerriniM #commutative #linear #logic #multi #quantifier
- Commutative Locative Quantifiers for Multiplicative Linear Logic (SG, PM), pp. 396–407.
- ICALP-v2-2006-Murlak
- The Wadge Hierarchy of Deterministic Tree Languages (FM), pp. 408–419.
- ICALP-v2-2006-BouyerHR #automaton #petri net #power of #sequence
- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences (PB, SH, PAR), pp. 420–431.
- ICALP-v2-2006-Jurdzinski #complexity #on the #problem #safety
- On Complexity of Grammars Related to the Safety Problem (TJ), pp. 432–443.
- ICALP-v2-2006-Levy #λ-calculus
- Jumbo λ-Calculus (PBL), pp. 444–455.
- ICALP-v2-2006-JagadeesanJPR #data access #named #programming
- λ-RBAC: Programming with Role-Based Access Control (RJ, AJ, CP, JR), pp. 456–467.
- ICALP-v2-2006-KarhumakiKO #communication
- Communication of Two Stacks and Rewriting (JK, MK, AO), pp. 468–479.
- ICALP-v2-2006-AcetoCFI #axiom #on the
- On the Axiomatizability of Priority (LA, TC, WF, AI), pp. 480–491.
- ICALP-v2-2006-AcetoFIL #communication #equation #finite
- A Finite Equational Base for CCS with Left Merge and Communication Merge (LA, WF, AI, BL), pp. 492–503.
- ICALP-v2-2006-LohreyS
- Theories of HNN-Extensions and Amalgamated Products (ML, GS), pp. 504–515.
- ICALP-v2-2006-KariantoKT #on the #problem #set
- On Intersection Problems for Polynomially Generated Sets (KW, AK, WT), pp. 516–527.
- ICALP-v2-2006-BalabanPZ #distributed #protocol #safety
- Invisible Safety of Distributed Protocols (IB, AP, LDZ), pp. 528–539.
- ICALP-v2-2006-BonattiLMV #calculus #complexity #μ-calculus
- The Complexity of Enriched μ-Calculi (PAB, CL, AM, MYV), pp. 540–551.
- ICALP-v2-2006-BenediktK #query
- Interpreting Tree-to-Tree Queries (MB, CK), pp. 552–564.
- ICALP-v2-2006-GenestM #automaton
- Constructing Exponential-Size Deterministic Zielonka Automata (BG, AM), pp. 565–576.
- ICALP-v2-2006-BozgaIL #automaton #parametricity
- Flat Parametric Counter Automata (MB, RI, YL), pp. 577–588.
- ICALP-v2-2006-Yan #automaton #bound
- Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (QY), pp. 589–600.
5 ×#game studies
5 ×#on the
4 ×#automaton
4 ×#encryption
4 ×#multi
4 ×#performance
3 ×#bound
3 ×#communication
3 ×#logic
3 ×#protocol
5 ×#on the
4 ×#automaton
4 ×#encryption
4 ×#multi
4 ×#performance
3 ×#bound
3 ×#communication
3 ×#logic
3 ×#protocol