Advances in Computer Games [[electronic resource] ] : 13th International Conference, ACG 2011, Tilburg, The Netherlands, November 20-22, 2011, Revised Selected Papers / / edited by H. Jaap van den Herik, Aske Plaat |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (XXIII, 356 p. 131 illus.) |
Disciplina | 794.8/1526 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Artificial intelligence Computer science Computer networks Computer science—Mathematics Discrete mathematics Numerical analysis Artificial Intelligence Theory of Computation Computer Communication Networks Discrete Mathematics in Computer Science Numerical Analysis |
ISBN | 3-642-31866-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465551303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Computer Games [[electronic resource] ] : 12th International Conference, ACG 2009, Pamplona, Spain, May 11-13, 2009, Revised Papers / / edited by H. Jaap van den Herik, Pieter Spronck |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 233 p. 75 illus.) |
Disciplina | 794.81526 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Algorithms Artificial intelligence Computer science Computer networks Computer science—Mathematics Discrete mathematics Programming Techniques Artificial Intelligence Theory of Computation Computer Communication Networks Discrete Mathematics in Computer Science |
ISBN |
1-280-38646-0
9786613564382 3-642-12993-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search -- A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm -- Monte-Carlo Tree Search in Settlers of Catan -- Evaluation Function Based Monte-Carlo LOA -- Monte-Carlo Kakuro -- A Study of UCT and Its Enhancements in an Artificial Game -- Creating an Upper-Confidence-Tree Program for Havannah -- Randomized Parallel Proof-Number Search -- Hex, Braids, the Crossing Rule, and XH-Search -- Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess -- Plans, Patterns, and Move Categories Guiding a Highly Selective Search -- 6-Man Chess and Zugzwangs -- Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K -- Conflict Resolution of Chinese Chess Endgame Knowledge Base -- On Drawn K-In-A-Row Games -- Optimal Analyses for 3×n AB Games in the Worst Case -- Automated Discovery of Search-Extension Features -- Deriving Concepts and Strategies from Chess Tablebases -- Incongruity-Based Adaptive Game Balancing -- Data Assurance in Opaque Computations. |
Record Nr. | UNINA-9910484836703321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Computer Games [[electronic resource] ] : 12th International Conference, ACG 2009, Pamplona, Spain, May 11-13, 2009, Revised Papers / / edited by H. Jaap van den Herik, Pieter Spronck |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 233 p. 75 illus.) |
Disciplina | 794.81526 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer programming
Algorithms Artificial intelligence Computer science Computer networks Computer science—Mathematics Discrete mathematics Programming Techniques Artificial Intelligence Theory of Computation Computer Communication Networks Discrete Mathematics in Computer Science |
ISBN |
1-280-38646-0
9786613564382 3-642-12993-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Adding Expert Knowledge and Exploration in Monte-Carlo Tree Search -- A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm -- Monte-Carlo Tree Search in Settlers of Catan -- Evaluation Function Based Monte-Carlo LOA -- Monte-Carlo Kakuro -- A Study of UCT and Its Enhancements in an Artificial Game -- Creating an Upper-Confidence-Tree Program for Havannah -- Randomized Parallel Proof-Number Search -- Hex, Braids, the Crossing Rule, and XH-Search -- Performance and Prediction: Bayesian Modelling of Fallible Choice in Chess -- Plans, Patterns, and Move Categories Guiding a Highly Selective Search -- 6-Man Chess and Zugzwangs -- Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K -- Conflict Resolution of Chinese Chess Endgame Knowledge Base -- On Drawn K-In-A-Row Games -- Optimal Analyses for 3×n AB Games in the Worst Case -- Automated Discovery of Search-Extension Features -- Deriving Concepts and Strategies from Chess Tablebases -- Incongruity-Based Adaptive Game Balancing -- Data Assurance in Opaque Computations. |
Record Nr. | UNISA-996465927103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Computer Games [[electronic resource] ] : 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-8, 2005. Revised Papers / / edited by H. Jaap van den Herik, Shun-Chin Hsu, Tsan-sheng Hsu, H.H.L.M. Donkers |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XIV, 273 p.) |
Disciplina | 794.8/1526 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence Algorithms Computer Science Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Artificial Intelligence |
ISBN | 3-540-48889-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Innovative Opening-Book Handling -- Partial Information Endgame Databases -- Automatic Generation of Search Engines -- RSPSA: Enhanced Parameter Optimization in Games -- Similarity Pruning in PrOM Search -- Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons -- Recognizing Seki in Computer Go -- Move-Pruning Techniques for Monte-Carlo Go -- A Phantom-Go Program -- Dual Lambda Search and Shogi Endgames -- Chunking in Shogi: New Findings -- King Race -- The Graph-History Interaction Problem in Chinese Chess -- A New Family of k-in-a-Row Games -- Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie -- Player Modeling, Search Algorithms and Strategies in Multi-player Games -- Solving Probabilistic Combinatorial Games -- On Colored Heap Games of Sumbers -- An Event-Based Pool Physics Simulator -- Optimization of a Billiard Player – Position Play. |
Record Nr. | UNISA-996465922903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Computer Games : 11th International Conference, ACG 2005, Taipei, Taiwan, September 6-8, 2005. Revised Papers / / edited by H. Jaap van den Herik, Shun-Chin Hsu, Tsan-sheng Hsu, H.H.L.M. Donkers |
Edizione | [1st ed. 2006.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
Descrizione fisica | 1 online resource (XIV, 273 p.) |
Disciplina | 794.8/1526 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Computer science—Mathematics Discrete mathematics Numerical analysis Mathematical statistics Artificial intelligence Algorithms Computer Science Discrete Mathematics in Computer Science Numerical Analysis Probability and Statistics in Computer Science Artificial Intelligence |
ISBN | 3-540-48889-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Innovative Opening-Book Handling -- Partial Information Endgame Databases -- Automatic Generation of Search Engines -- RSPSA: Enhanced Parameter Optimization in Games -- Similarity Pruning in PrOM Search -- Enhancing Search Efficiency by Using Move Categorization Based on Game Progress in Amazons -- Recognizing Seki in Computer Go -- Move-Pruning Techniques for Monte-Carlo Go -- A Phantom-Go Program -- Dual Lambda Search and Shogi Endgames -- Chunking in Shogi: New Findings -- King Race -- The Graph-History Interaction Problem in Chinese Chess -- A New Family of k-in-a-Row Games -- Exact-Bound Analyzes and Optimal Strategies for Mastermind with a Lie -- Player Modeling, Search Algorithms and Strategies in Multi-player Games -- Solving Probabilistic Combinatorial Games -- On Colored Heap Games of Sumbers -- An Event-Based Pool Physics Simulator -- Optimization of a Billiard Player – Position Play. |
Record Nr. | UNINA-9910484301603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Computer Science - ASIAN 2004, Higher Level Decision Making [[electronic resource] ] : 9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday, Chiang Mai, Thailand, December 8-10, 2004 / / edited by Michael J. Maher |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 510 p.) |
Disciplina | 004.0151 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Artificial intelligence Software engineering Data encryption (Computer science) Computer science—Mathematics Application software Theory of Computation Artificial Intelligence Software Engineering/Programming and Operating Systems Cryptology Discrete Mathematics in Computer Science Information Systems Applications (incl. Internet) |
ISBN | 3-540-30502-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Keynote Papers -- Counting by Coin Tossings -- On the Role Definitions in and Beyond Cryptography -- Meme Media for the Knowledge Federation Over the Web and Pervasive Computing Environments -- Contributed Papers -- Probabilistic Space Partitioning in Constraint Logic Programming -- Chi-Square Matrix: An Approach for Building-Block Identification -- Design Exploration Framework Under Impreciseness Based on Register-Constrained Inclusion Scheduling -- Hiord: A Type-Free Higher-Order Logic Programming Language with Predicate Abstraction -- Assessment Aggregation in the Evidential Reasoning Approach to MADM Under Uncertainty: Orthogonal Versus Weighted Sum -- Learnability of Simply-Moded Logic Programs from Entailment -- A Temporalised Belief Logic for Specifying the Dynamics of Trust for Multi-agent Systems -- Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing -- Identity-Based Authenticated Broadcast Encryption and Distributed Authenticated Encryption -- Deniable Partial Proxy Signatures -- Formal Concept Mining: A Statistic-Based Approach for Pertinent Concept Lattice Construction -- A Robust Approach to Content-Based Musical Genre Classification and Retrieval Using Multi-feature Clustering -- Registration of 3D Range Images Using Particle Swarm Optimization -- Zero-Clairvoyant Scheduling with Inter-period Constraints -- A Novel Texture Synthesis Based Algorithm for Object Removal in Photographs -- Highly Efficient and Effective Techniques for Thai Syllable Speech Recognition -- Robot Visual Servoing Based on Total Jacobian -- Invited Papers -- Online Stochastic and Robust Optimization -- Optimal Constraint Decomposition for Distributed Databases -- Adaptive Random Testing -- Minimal Unsatisfiable Sets: Classification and Bounds -- LPOD Answer Sets and Nash Equilibria -- Graph Theoretic Models for Reasoning About Time -- Rule-Based Programming and Proving: The ELAN Experience Outcomes -- Towards Flexible Graphical Communication Using Adaptive Diagrams -- A Framework for Compiler Driven Design Space Exploration for Embedded System Customization -- Spectral-Based Document Retrieval -- Metadata Inference for Document Retrieval in a Distributed Repository -- A Simple Theory of Expressions, Judgments and Derivations -- Reactive Framework for Resource Aware Distributed Computing -- The Feature Selection and Intrusion Detection Problems -- On the BDD of a Random Boolean Function -- Concurrent Constraint-Based Memory Machines: A Framework for Java Memory Models (Summary). |
Record Nr. | UNISA-996466347603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2000 [[electronic resource] ] : 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000 Proceedings / / edited by Tatsuaki Okamoto |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 636 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Algorithms Management information systems Computer science Computer communication systems Cryptology Mathematics of Computing Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-540-44448-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cryptanalysis I -- Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers -- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99 -- Why Textbook ElGamal and RSA Encryption Are Insecure -- Cryptanalysis of the TTM Cryptosystem -- Attacking and Repairing Batch Verification Schemes -- IACR Distinguished Lecture -- Cryptography Everywhere -- Digital Signatures -- Security of Signed ElGamal Encryption -- From Fixed-Length to Arbitrary-Length RSA Padding Schemes -- Towards Signature-Only Signature Schemes -- A New Forward-Secure Digital Signature Scheme -- Unconditionally Secure Digital Signature Schemes Admitting Transferability -- Protocols I -- Efficient Secure Multi-party Computation -- Mix and Match: Secure Function Evaluation via Ciphertexts -- A Length-Invariant Hybrid Mix -- Attack for Flash MIX -- Distributed Oblivious Transfer -- Number Theoretic Algorithms -- Key Improvements to XTR -- Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders -- Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three -- Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems -- Symmetric-Key Schemes I -- Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis -- On the Pseudorandomness of Top-Level Schemes of Block Ciphers -- Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers -- Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography -- Protocols II -- Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes -- Addition of El Gamal Plaintexts -- Improved Methods to Perform Threshold RSA -- Commital Deniable Proofs and Electronic Campaign Finance -- Provably Secure Metering Scheme -- Invited Lecture -- CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government -- Fingerprinting -- Anonymous Fingerprinting with Direct Non-repudiation -- Efficient Anonymous Fingerprinting with Group Signatures -- Zero-Knowledge and Provable Security -- Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems -- Zero-Knowledge and Code Obfuscation -- A Note on Security Proofs in the Generic Model -- Boolean Functions -- On Relationships among Avalanche, Nonlinearity, and Correlation Immunity -- Cryptanalysis II -- Cryptanalysis of the Yi-Lam Hash -- Power Analysis, What Is Now Possible... -- Pseudorandomness -- Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications -- Symmetric-Key Schemes II -- The Security of Chaffing and Winnowing -- Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm -- Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques -- Proofs of Security for the Unix Password Hashing Algorithm -- Public-Key Encryption and Key Distribution -- Trapdooring Discrete Logarithms on Elliptic Curves over Rings -- Strengthening McEliece Cryptosystem -- Password-Authenticated Key Exchange Based on RSA -- Round-Efficient Conference Key Agreement Protocols with Provable Security. |
Record Nr. | UNISA-996466009303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2000 : 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000 Proceedings / / edited by Tatsuaki Okamoto |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 636 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Data encryption (Computer science)
Computer science—Mathematics Algorithms Management information systems Computer science Computer communication systems Cryptology Mathematics of Computing Algorithm Analysis and Problem Complexity Management of Computing and Information Systems Computer Communication Networks |
ISBN | 3-540-44448-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cryptanalysis I -- Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers -- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99 -- Why Textbook ElGamal and RSA Encryption Are Insecure -- Cryptanalysis of the TTM Cryptosystem -- Attacking and Repairing Batch Verification Schemes -- IACR Distinguished Lecture -- Cryptography Everywhere -- Digital Signatures -- Security of Signed ElGamal Encryption -- From Fixed-Length to Arbitrary-Length RSA Padding Schemes -- Towards Signature-Only Signature Schemes -- A New Forward-Secure Digital Signature Scheme -- Unconditionally Secure Digital Signature Schemes Admitting Transferability -- Protocols I -- Efficient Secure Multi-party Computation -- Mix and Match: Secure Function Evaluation via Ciphertexts -- A Length-Invariant Hybrid Mix -- Attack for Flash MIX -- Distributed Oblivious Transfer -- Number Theoretic Algorithms -- Key Improvements to XTR -- Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders -- Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three -- Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems -- Symmetric-Key Schemes I -- Provable Security for the Skipjack-like Structure against Differential Cryptanalysis and Linear Cryptanalysis -- On the Pseudorandomness of Top-Level Schemes of Block Ciphers -- Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers -- Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography -- Protocols II -- Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes -- Addition of El Gamal Plaintexts -- Improved Methods to Perform Threshold RSA -- Commital Deniable Proofs and Electronic Campaign Finance -- Provably Secure Metering Scheme -- Invited Lecture -- CRYPTREC Project Cryptographic Evaluation Project for the Japanese Electronic Government -- Fingerprinting -- Anonymous Fingerprinting with Direct Non-repudiation -- Efficient Anonymous Fingerprinting with Group Signatures -- Zero-Knowledge and Provable Security -- Increasing the Power of the Dealer in Non-interactive Zero-Knowledge Proof Systems -- Zero-Knowledge and Code Obfuscation -- A Note on Security Proofs in the Generic Model -- Boolean Functions -- On Relationships among Avalanche, Nonlinearity, and Correlation Immunity -- Cryptanalysis II -- Cryptanalysis of the Yi-Lam Hash -- Power Analysis, What Is Now Possible... -- Pseudorandomness -- Concrete Security Characterizations of PRFs and PRPs: Reductions and Applications -- Symmetric-Key Schemes II -- The Security of Chaffing and Winnowing -- Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm -- Increasing the Lifetime of a Key: A Comparative Analysis of the Security of Re-keying Techniques -- Proofs of Security for the Unix Password Hashing Algorithm -- Public-Key Encryption and Key Distribution -- Trapdooring Discrete Logarithms on Elliptic Curves over Rings -- Strengthening McEliece Cryptosystem -- Password-Authenticated Key Exchange Based on RSA -- Round-Efficient Conference Key Agreement Protocols with Provable Security. |
Record Nr. | UNINA-9910143608003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Advances in Cryptology - ASIACRYPT 2002 [[electronic resource] ] : 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings / / edited by Yuliang Zheng |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XIV, 582 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Coding theory
Information theory Data encryption (Computer science) Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Coding and Information Theory Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
ISBN | 3-540-36178-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Analysis of Bernstein’s Factorization Circuit -- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order -- Looking beyond XTR -- Bounds for Robust Metering Schemes and Their Relationship with A2-code -- Unconditionally Secure Anonymous Encryption and Group Authentication -- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model -- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives -- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order -- Efficient Oblivious Transfer in the Bounded-Storage Model -- In How Many Ways Can You Write Rijndael? -- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis -- Threshold Cryptosystems Based on Factoring -- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments -- Asynchronous Secure Communication Tolerating Mixed Adversaries -- Amplified Boomerang Attack against Reduced-Round SHACAL -- Enhancing Differential-Linear Cryptanalysis -- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations -- Analysis of Neural Cryptography -- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm -- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 -- A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme -- On Unconditionally Secure Robust Distributed Key Distribution Centers -- Short Signatures in the Random Oracle Model -- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes -- Transitive Signatures Based on Factoring and RSA -- 1-out-of-n Signatures from a Variety of Keys -- A Revocation Scheme with Minimal Storage at Receivers -- Optimistic Mixing for Exit-Polls -- Improved Construction of Nonlinear Resilient S-Boxes -- An Upper Bound on the Number of m-Resilient Boolean Functions -- Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks -- Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization -- ID-Based Blind Signature and Ring Signature from Pairings -- Hierarchical ID-Based Cryptography -- Crypto-integrity -- Gummy and Conductive Silicone Rubber Fingers Importance of Vulnerability Analysis. |
Record Nr. | UNISA-996465387203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Advances in Cryptology - ASIACRYPT 2002 : 8th International Conference on the Theory and Application of Cryptology and Information Security, Queenstown, New Zealand, December 1-5, 2002, Proceedings / / edited by Yuliang Zheng |
Edizione | [1st ed. 2002.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
Descrizione fisica | 1 online resource (XIV, 582 p.) |
Disciplina | 005.8 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Coding theory
Information theory Data encryption (Computer science) Computer communication systems Operating systems (Computers) Algorithms Computer science—Mathematics Coding and Information Theory Cryptology Computer Communication Networks Operating Systems Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science |
ISBN | 3-540-36178-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Analysis of Bernstein’s Factorization Circuit -- A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown Order -- Looking beyond XTR -- Bounds for Robust Metering Schemes and Their Relationship with A2-code -- Unconditionally Secure Anonymous Encryption and Group Authentication -- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model -- On the Impossibilities of Basing One-Way Permutations on Central Cryptographic Primitives -- A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order -- Efficient Oblivious Transfer in the Bounded-Storage Model -- In How Many Ways Can You Write Rijndael? -- On the Security of Rijndael-Like Structures against Differential and Linear Cryptanalysis -- Threshold Cryptosystems Based on Factoring -- Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments -- Asynchronous Secure Communication Tolerating Mixed Adversaries -- Amplified Boomerang Attack against Reduced-Round SHACAL -- Enhancing Differential-Linear Cryptanalysis -- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations -- Analysis of Neural Cryptography -- The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm -- A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2 -- A General Formula of the (t, n)-Threshold Visual Secret Sharing Scheme -- On Unconditionally Secure Robust Distributed Key Distribution Centers -- Short Signatures in the Random Oracle Model -- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes -- Transitive Signatures Based on Factoring and RSA -- 1-out-of-n Signatures from a Variety of Keys -- A Revocation Scheme with Minimal Storage at Receivers -- Optimistic Mixing for Exit-Polls -- Improved Construction of Nonlinear Resilient S-Boxes -- An Upper Bound on the Number of m-Resilient Boolean Functions -- Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks -- Secure Channels Based on Authenticated Encryption Schemes: A Simple Characterization -- ID-Based Blind Signature and Ring Signature from Pairings -- Hierarchical ID-Based Cryptography -- Crypto-integrity -- Gummy and Conductive Silicone Rubber Fingers Importance of Vulnerability Analysis. |
Record Nr. | UNINA-9910143897103321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|