LEADER 06258nam 22008055 450 001 9910483713803321 005 20230406054927.0 010 $a3-540-35908-7 024 7 $a10.1007/11787006 035 $a(CKB)1000000000233042 035 $a(SSID)ssj0000316394 035 $a(PQKBManifestationID)11205463 035 $a(PQKBTitleCode)TC0000316394 035 $a(PQKBWorkID)10281800 035 $a(PQKB)11085017 035 $a(DE-He213)978-3-540-35908-1 035 $a(MiAaPQ)EBC3068254 035 $a(PPN)123136474 035 $a(EXLCZ)991000000000233042 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages and Programming$b[electronic resource] $e33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II /$fedited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XXIV, 612 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4052 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-35907-9 320 $aIncludes bibliographical references and index. 327 $aInvited Papers -- Differential Privacy -- The One Way to Quantum Computation -- Zero-Knowledge and Signatures -- Efficient Zero Knowledge on the Internet -- Independent Zero-Knowledge Sets -- An Efficient Compiler from ?-Protocol to 2-Move Deniable Zero-Knowledge -- New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures -- Cryptographic Protocols -- Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption -- Cryptographically Sound Implementations for Communicating Processes -- A Dolev-Yao-Based Definition of Abuse-Free Protocols -- Secrecy and Protocol Analysis -- Preserving Secrecy Under Refinement -- Quantifying Information Leakage in Process Calculi -- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or -- Cryptographic Primitives -- Generalized Compact Knapsacks Are Collision Resistant -- An Efficient Provable Distinguisher for HFE -- A Tight Bound for EMAC -- Constructing Single- and Multi-output Boolean Functions with Maximal Algebraic Immunity -- Bounded Storage and Quantum Models -- On Everlasting Security in the Hybrid Bounded Storage Model -- On the Impossibility of Extracting Classical Randomness Using a Quantum Computer -- Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding -- Foundations -- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions -- Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes -- A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs -- Multi-party Protocols -- Generic Construction of Hybrid Public Key Traitor Tracing with Full-Public-Traceability -- An Adaptively Secure Mix-Net Without Erasures -- Multipartite Secret Sharing by Bivariate Interpolation -- Identity-Based Encryption Gone Wild -- Games -- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games -- Recursive Concurrent Stochastic Games -- Half-Positional Determinacy of Infinite Games -- A Game-Theoretic Approach to Deciding Higher-Order Matching -- Semantics -- Descriptive and Relative Completeness of Logics for Higher-Order Functions -- Interpreting Polymorphic FPC into Domain Theoretic Models of Parametric Polymorphism -- Typed GoI for Exponentials -- Commutative Locative Quantifiers for Multiplicative Linear Logic -- Automata I -- The Wadge Hierarchy of Deterministic Tree Languages -- Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences -- On Complexity of Grammars Related to the Safety Problem -- Models -- Jumbo ?-Calculus -- ?-RBAC: Programming with Role-Based Access Control -- Communication of Two Stacks and Rewriting -- Equations -- On the Axiomatizability of Priority -- A Finite Equational Base for CCS with Left Merge and Communication Merge -- Theories of HNN-Extensions and Amalgamated Products -- On Intersection Problems for Polynomially Generated Sets -- Logics -- Invisible Safety of Distributed Protocols -- The Complexity of Enriched ?-Calculi -- Interpreting Tree-to-Tree Queries -- Automata II -- Constructing Exponential-Size Deterministic Zielonka Automata -- Flat Parametric Counter Automata -- Lower Bounds for Complementation of ?-Automata Via the Full Automata Technique. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4052 606 $aComputer science 606 $aComputer programming 606 $aSoftware engineering 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aArtificial intelligence?Data processing 606 $aTheory of Computation 606 $aProgramming Techniques 606 $aSoftware Engineering 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aData Science 615 0$aComputer science. 615 0$aComputer programming. 615 0$aSoftware engineering. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aArtificial intelligence?Data processing. 615 14$aTheory of Computation. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aData Science. 676 $a004.0151 702 $aBugliesi$b Michele$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPreneel$b Bart$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSassone$b Vladimiro$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWegener$b Ingo$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910483713803321 996 $aAutomata, languages and programming$9339738 997 $aUNINA