000 05547nam a22006135i 4500
001 978-3-540-35908-1
003 DE-He213
005 20160624101932.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540359081
_9978-3-540-35908-1
024 7 _a10.1007/11787006
_2doi
050 4 _aQA75.5-76.95
072 7 _aUY
_2bicssc
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aCOM031000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aAutomata, Languages and Programming
_h[electronic resource] :
_b33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part II /
_cedited by Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2006.
300 _aXXIV, 612 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4052
505 0 _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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aElectronic data processing.
650 0 _aComputational complexity.
650 1 4 _aComputer Science.
650 2 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering/Programming and Operating Systems.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aNumeric Computing.
650 2 4 _aData Structures.
650 2 4 _aData Structures, Cryptology and Information Theory.
700 1 _aBugliesi, Michele.
_eeditor.
700 1 _aPreneel, Bart.
_eeditor.
700 1 _aSassone, Vladimiro.
_eeditor.
700 1 _aWegener, Ingo.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540359074
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v4052
856 4 0 _uhttp://dx.doi.org/10.1007/11787006
942 _2EBK4193
_cEBK
999 _c33487
_d33487