Security in Communication Networks [[electronic resource] ] : 4th International Conference, SCN 2004, Amalfi, Italy, September 8-10, 2004, Revised Selected Papers / / edited by Carlo Blundo, Stelvio Cimato |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 388 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Data encryption (Computer science)
Computer communication systems Operating systems (Computers) Computers and civilization Management information systems Computer science Algorithms Cryptology Computer Communication Networks Operating Systems Computers and Society Management of Computing and Information Systems Algorithm Analysis and Problem Complexity |
Soggetto non controllato |
Communication networks
SCN Security |
ISBN | 3-540-30598-X |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talk -- ECRYPT: The Cryptographic Research Challenges for the Next Decade -- Reduction of Security/Primitives -- Relationships Between Diffie-Hellman and “Index Oracles” -- On the Security Notions for Public-Key Encryption Schemes -- Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel -- Signature Schemes -- A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs -- Group Signatures with Separate and Distributed Authorities -- Threshold Cryptography in Mobile Ad Hoc Networks -- Anonymity and Privacy -- Designated Verifier Signatures: Anonymity and Efficient Construction from Any Bilinear Map -- Group Signatures: Better Efficiency and New Theoretical Aspects -- Efficient Blind Signatures Without Random Oracles -- Authentication and Identification -- Minimalist Cryptography for Low-Cost RFID Tags (Extended Abstract) -- On the Key Exposure Problem in Chameleon Hashes -- Zero Knowledge -- Identity-Based Zero-Knowledge -- Public Key Cryptosystems -- A Robust Multisignature Scheme with Applications to Acknowledgement Aggregation -- Efficient Key Encapsulation to Multiple Parties -- Improved Signcryption from q-Diffie-Hellman Problems -- Distributed Cryptography -- Colored Visual Cryptography Without Color Darkening -- On the Size of Monotone Span Programs -- Universally Composable DKG with Linear Number of Exponentiations -- Cryptanalysis of Public Key Cryptosystems -- An Algebraic Approach to NTRU (q = 2 n ) via Witt Vectors and Overdetermined Systems of Nonlinear Equations -- Efficient Cryptanalysis of RSE(2)PKC and RSSE(2)PKC -- Cryptanalysis -- The Decimated Sample Based Improved Algebraic Attacks on the Nonlinear Filters -- Non-randomness of the Full 4 and 5-Pass HAVAL -- Email Security -- Controlling Spam by Secure Internet Content Selection -- Key Distribution and Feedback Shift Registers -- On Session Identifiers in Provably Secure Protocols -- How to Embed Short Cycles into Large Nonlinear Feedback-Shift Registers. |
Record Nr. | UNISA-996466060603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theoretical Computer Science [[electronic resource] ] : 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings / / edited by Carlo Blundo, Cosimo Laneve |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (XII, 400 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Data structures (Computer science) Algorithms Computer logic Mathematical logic Theory of Computation Computation by Abstract Devices Data Structures Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
ISBN | 3-540-45208-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Extreme Nash Equilibria -- Certification of Memory Usage -- On Programming Models for Mobility -- Program Design, Models and Analysis -- On the Computational Complexity of Cut-Elimination in Linear Logic -- A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics -- Finite Horizon Analysis of Stochastic Systems with the Mur? Verifier -- Towards Compact and Tractable Automaton-Based Representations of Time Granularities -- Lower Bounds on the Size of Quantum Automata Accepting Unary Languages -- Refined Effects for Unanticipated Object Re-classification: -- Algorithms and Complexity -- Cost Constrained Fixed Job Scheduling -- A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set -- An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality -- Channel Assignment in Honeycomb Networks -- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks -- The Complexity of Checking Consistency of Pedigree Information and Related Problems -- On Clausal Equivalence and Hull Inclusion -- Semantics and Formal Languages -- Logical Semantics for the First Order ?-Calculus -- On the Expressive Power of Light Affine Logic -- Reasoning about Self and Others: Communicating Agents in a Modal Action Logic -- Decidability Properties of Recursive Types -- Algebraic Theories for Contextual Pre-nets -- A Coalgebraic Description of Web Interactions -- A Calculus for Dynamic Linking -- Towards a Smart Compilation Manager for Java -- Security and Cryptography -- Anonymous Group Communication in Mobile Networks -- Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences -- An Information-Theoretic Approach to the Access Control Problem -- Security-Aware Program Transformations -- Information Flow Security and Recursive Systems -- Compositional Verification of Secure Streamed Data: A Case Study with EMSS. |
Record Nr. | UNISA-996465781303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theoretical Computer Science : 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings / / edited by Carlo Blundo, Cosimo Laneve |
Edizione | [1st ed. 2003.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Descrizione fisica | 1 online resource (XII, 400 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Data structures (Computer science) Algorithms Computer logic Mathematical logic Theory of Computation Computation by Abstract Devices Data Structures Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
ISBN | 3-540-45208-7 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Talks -- Extreme Nash Equilibria -- Certification of Memory Usage -- On Programming Models for Mobility -- Program Design, Models and Analysis -- On the Computational Complexity of Cut-Elimination in Linear Logic -- A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics -- Finite Horizon Analysis of Stochastic Systems with the Mur? Verifier -- Towards Compact and Tractable Automaton-Based Representations of Time Granularities -- Lower Bounds on the Size of Quantum Automata Accepting Unary Languages -- Refined Effects for Unanticipated Object Re-classification: -- Algorithms and Complexity -- Cost Constrained Fixed Job Scheduling -- A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set -- An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality -- Channel Assignment in Honeycomb Networks -- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks -- The Complexity of Checking Consistency of Pedigree Information and Related Problems -- On Clausal Equivalence and Hull Inclusion -- Semantics and Formal Languages -- Logical Semantics for the First Order ?-Calculus -- On the Expressive Power of Light Affine Logic -- Reasoning about Self and Others: Communicating Agents in a Modal Action Logic -- Decidability Properties of Recursive Types -- Algebraic Theories for Contextual Pre-nets -- A Coalgebraic Description of Web Interactions -- A Calculus for Dynamic Linking -- Towards a Smart Compilation Manager for Java -- Security and Cryptography -- Anonymous Group Communication in Mobile Networks -- Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences -- An Information-Theoretic Approach to the Access Control Problem -- Security-Aware Program Transformations -- Information Flow Security and Recursive Systems -- Compositional Verification of Secure Streamed Data: A Case Study with EMSS. |
Record Nr. | UNINA-9910768183003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|