Cryptology and Network Security [[electronic resource] ] : 4th International Conference, CANS 2005, Xiamen, China, December 14-16, 2005, Proceedings / / edited by Yvo G. Desmedt, Huaxiong Wang, Yi Mu, Yongqing Li |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XII, 352 p.) |
Disciplina | 005.8 |
Collana | Security and Cryptology |
Soggetto topico |
Computer communication systems
Data encryption (Computer science) Operating systems (Computers) Management information systems Computer science Computers and civilization Algorithms Computer Communication Networks Cryptology Operating Systems Management of Computing and Information Systems Computers and Society Algorithm Analysis and Problem Complexity |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Cryptanalysis -- The Second-Preimage Attack on MD4 -- On the Security of Certificateless Signature Schemes from Asiacrypt 2003 -- On the Security of a Group Signcryption Scheme from Distributed Signcryption Scheme -- Cryptanalysis of Two Group Key Management Protocols for Secure Multicast -- Security Analysis of Password-Authenticated Key Agreement Protocols -- Intrusion Detection and Viruses -- An Immune-Based Model for Computer Virus Detection -- A New Model for Dynamic Intrusion Detection -- Self Debugging Mode for Patch-Independent Nullification of Unknown Remote Process Infection -- A New Unsupervised Anomaly Detection Framework for Detecting Network Attacks in Real-Time -- Authentication and Signature -- ID-Based Aggregate Signatures from Bilinear Pairings -- Efficient Identity-Based Signatures and Blind Signatures -- How to Authenticate Real Time Streams Using Improved Online/Offline Signatures -- New Authentication Scheme Based on a One-Way Hash Function and Diffie-Hellman Key Exchange -- Signcryption -- Two Proxy Signcryption Schemes from Bilinear Pairings -- Constructing Secure Warrant-Based Proxy Signcryption Schemes -- E-mail Security -- Design and Implementation of an Inline Certified E-mail Service -- Efficient Identity-Based Protocol for Fair Certified E-mail Delivery -- Cryptosystems -- Similar Keys of Multivariate Quadratic Public Key Cryptosystems -- A Note on Signed Binary Window Algorithm for Elliptic Curve Cryptosystems -- Constructions of Almost Resilient Functions -- Privacy and Tracing -- A Novel Method to Maintain Privacy in Mobile Agent Applications -- Non-expanding Transaction Specific Pseudonymization for IP Traffic Monitoring -- Information Hiding -- Revaluation of Error Correcting Coding in Watermarking Channel -- Firewalls, Denial of Service and DNS Security -- On the Performance and Analysis of DNS Security Extensions -- On Securing RTP-Based Streaming Content with Firewalls -- Safeguard Information Infrastructure Against DDoS Attacks: Experiments and Modeling -- Trust Management -- Distributed Credential Chain Discovery in Trust-Management with Parameterized Roles. |
Record Nr. | UNISA-996465378403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
Proceedings of the First International Workshop on Coding and Cryptology, Wuyi Mountain, Fujian, China 11-15 June 2007 [[electronic resource] /] / editors, Yongqing Li ... [et al.] |
Pubbl/distr/stampa | New Jersey, : World Scientific, c2008 |
Descrizione fisica | 1 online resource (288 p.) |
Disciplina | 003/.54 |
Altri autori (Persone) | LiYongqing |
Collana | Series on coding theory and cryptology |
Soggetto topico |
Coding theory
Cryptography Number theory Computer security |
Soggetto genere / forma | Electronic books. |
ISBN | 981-283-224-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Preface; Organizing Committees; CONTENTS; Fuzzy Identity-based Encryption: New and Efficient Schemes J. Baek, W. Susilo and J. Zhou; 1. Introduction; 2. Preliminaries; 3. Proposed Fuzzy IBE Schemes; 4. Comparisons; 5. Concluding Remarks; References; A Functional View of Upper Bounds on Codes A. Barg and D. Nogin; 1. Introduction; 2. Functional approach; 2.1. Notation.; 2.2. Construction of polynomials.; 2.2.1. The MRRW polynomial.; 2.2.2. Levenshtein polynomials, n = 2k + 1:; 2.2.3. Levenshtein polynomials, n = 2k + 2:; 3. Spectral method; References
A Method of Construction of Balanced Functions with Optimum Algebraic Immunity C. Carlet1. Introduction; 2. Preliminaries; 3. The general method; 4. Constructing functions with optimum algebraic immunity; 5. Study of the Walsh transforms of the constructed functions and their nonlinearity; 6. Constructing functions with optimum algebraic immunity, in odd numbers of variables; References; Enumeration of a Class of Sequences Generated by Inversions A. C e seml_io glu, W. Meidl and A. Topuzo glu; 1. Introduction; 2. Preliminaries; 3. Proofs of Theorems 1.1 and 1.2; 4. Remarks; References A Critical Look at Cryptographic Hash Function Literature S. Contini, R. Steinfeld, J. Pieprzyk and K. Matusiewicz1. Introduction; 2. A Brief History of Cryptographic Hashing; 2.1. Definitions of Hash Functions; 2.2. Random Oracles; 2.3. Other Requirements for Hash Functions; 2.4. Summary; 3. Ordinary Hash Functions Versus Hash Function Families; 3.1. Ordinary Hash Functions; 3.1.1. Definitions and Implications of Security Properties; 3.2. Hash Functions Families; 4. What to Do about all the Cryptographic Hash Function Definitions?; 5. Moving Forward; 6. Conclusion; References; Appendix A. 7. Security Requirement De nitionsScalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects Y. M. Chee and C. J. Colbourn; 1. Introduction; 2. Testing Under a Generalized MAF Model; 3. Optimal Crosstalk Test Arrays; 4. Implementation; 4.1. Testing Data Buses; 4.2. Testing Address Buses; 5. Significance; 6. Conclusion; Acknowledgments; References; An Improved Distinguisher for Dragon J. Y. Cho and J. Pieprzyk; 1. Introduction; 2. A brief description of Dragon; 3. A linear distinguisher for Dragon; 3.1. Approximations of functions G and H 3.1.1. Approximations of the function H3.1.2. Approximations of the function G; 3.2. Linear approximations of modular addition; 3.3. Linear approximation of the function F; 3.3.1. The approximation of a0; 3.3.2. The approximation of e0; 3.4. Building the distinguisher; 3.5. Our results; 4. Improving the distinguisher; 4.1. Experiments; 5. Conclusion; Acknowledgment; References; Appendix A. Proof of Theorem 3.1; Appendix B. Proof of Corollary 3.1; Appendix C. Proof of Lemma 4.1; Constructing Perfect Hash Families Using a Greedy Algorithm C. J. Colbourn; 1. Introduction 2. Density and a Greedy Algorithm |
Record Nr. | UNINA-9910455549003321 |
New Jersey, : World Scientific, c2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the First International Workshop on Coding and Cryptology, Wuyi Mountain, Fujian, China 11-15 June 2007 [[electronic resource] /] / editors, Yongqing Li ... [et al.] |
Pubbl/distr/stampa | New Jersey, : World Scientific, c2008 |
Descrizione fisica | 1 online resource (288 p.) |
Disciplina | 003/.54 |
Altri autori (Persone) | LiYongqing |
Collana | Series on coding theory and cryptology |
Soggetto topico |
Coding theory
Cryptography Number theory Computer security |
ISBN | 981-283-224-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Preface; Organizing Committees; CONTENTS; Fuzzy Identity-based Encryption: New and Efficient Schemes J. Baek, W. Susilo and J. Zhou; 1. Introduction; 2. Preliminaries; 3. Proposed Fuzzy IBE Schemes; 4. Comparisons; 5. Concluding Remarks; References; A Functional View of Upper Bounds on Codes A. Barg and D. Nogin; 1. Introduction; 2. Functional approach; 2.1. Notation.; 2.2. Construction of polynomials.; 2.2.1. The MRRW polynomial.; 2.2.2. Levenshtein polynomials, n = 2k + 1:; 2.2.3. Levenshtein polynomials, n = 2k + 2:; 3. Spectral method; References
A Method of Construction of Balanced Functions with Optimum Algebraic Immunity C. Carlet1. Introduction; 2. Preliminaries; 3. The general method; 4. Constructing functions with optimum algebraic immunity; 5. Study of the Walsh transforms of the constructed functions and their nonlinearity; 6. Constructing functions with optimum algebraic immunity, in odd numbers of variables; References; Enumeration of a Class of Sequences Generated by Inversions A. C e seml_io glu, W. Meidl and A. Topuzo glu; 1. Introduction; 2. Preliminaries; 3. Proofs of Theorems 1.1 and 1.2; 4. Remarks; References A Critical Look at Cryptographic Hash Function Literature S. Contini, R. Steinfeld, J. Pieprzyk and K. Matusiewicz1. Introduction; 2. A Brief History of Cryptographic Hashing; 2.1. Definitions of Hash Functions; 2.2. Random Oracles; 2.3. Other Requirements for Hash Functions; 2.4. Summary; 3. Ordinary Hash Functions Versus Hash Function Families; 3.1. Ordinary Hash Functions; 3.1.1. Definitions and Implications of Security Properties; 3.2. Hash Functions Families; 4. What to Do about all the Cryptographic Hash Function Definitions?; 5. Moving Forward; 6. Conclusion; References; Appendix A. 7. Security Requirement De nitionsScalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects Y. M. Chee and C. J. Colbourn; 1. Introduction; 2. Testing Under a Generalized MAF Model; 3. Optimal Crosstalk Test Arrays; 4. Implementation; 4.1. Testing Data Buses; 4.2. Testing Address Buses; 5. Significance; 6. Conclusion; Acknowledgments; References; An Improved Distinguisher for Dragon J. Y. Cho and J. Pieprzyk; 1. Introduction; 2. A brief description of Dragon; 3. A linear distinguisher for Dragon; 3.1. Approximations of functions G and H 3.1.1. Approximations of the function H3.1.2. Approximations of the function G; 3.2. Linear approximations of modular addition; 3.3. Linear approximation of the function F; 3.3.1. The approximation of a0; 3.3.2. The approximation of e0; 3.4. Building the distinguisher; 3.5. Our results; 4. Improving the distinguisher; 4.1. Experiments; 5. Conclusion; Acknowledgment; References; Appendix A. Proof of Theorem 3.1; Appendix B. Proof of Corollary 3.1; Appendix C. Proof of Lemma 4.1; Constructing Perfect Hash Families Using a Greedy Algorithm C. J. Colbourn; 1. Introduction 2. Density and a Greedy Algorithm |
Record Nr. | UNINA-9910777940403321 |
New Jersey, : World Scientific, c2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Proceedings of the First International Workshop on Coding and Cryptology, Wuyi Mountain, Fujian, China 11-15 June 2007 / / editors, Yongqing Li ... [et al.] |
Edizione | [1st ed.] |
Pubbl/distr/stampa | New Jersey, : World Scientific, c2008 |
Descrizione fisica | 1 online resource (288 p.) |
Disciplina | 003/.54 |
Altri autori (Persone) | LiYongqing |
Collana | Series on coding theory and cryptology |
Soggetto topico |
Coding theory
Cryptography Number theory Computer security |
ISBN | 981-283-224-6 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Preface; Organizing Committees; CONTENTS; Fuzzy Identity-based Encryption: New and Efficient Schemes J. Baek, W. Susilo and J. Zhou; 1. Introduction; 2. Preliminaries; 3. Proposed Fuzzy IBE Schemes; 4. Comparisons; 5. Concluding Remarks; References; A Functional View of Upper Bounds on Codes A. Barg and D. Nogin; 1. Introduction; 2. Functional approach; 2.1. Notation.; 2.2. Construction of polynomials.; 2.2.1. The MRRW polynomial.; 2.2.2. Levenshtein polynomials, n = 2k + 1:; 2.2.3. Levenshtein polynomials, n = 2k + 2:; 3. Spectral method; References
A Method of Construction of Balanced Functions with Optimum Algebraic Immunity C. Carlet1. Introduction; 2. Preliminaries; 3. The general method; 4. Constructing functions with optimum algebraic immunity; 5. Study of the Walsh transforms of the constructed functions and their nonlinearity; 6. Constructing functions with optimum algebraic immunity, in odd numbers of variables; References; Enumeration of a Class of Sequences Generated by Inversions A. C e seml_io glu, W. Meidl and A. Topuzo glu; 1. Introduction; 2. Preliminaries; 3. Proofs of Theorems 1.1 and 1.2; 4. Remarks; References A Critical Look at Cryptographic Hash Function Literature S. Contini, R. Steinfeld, J. Pieprzyk and K. Matusiewicz1. Introduction; 2. A Brief History of Cryptographic Hashing; 2.1. Definitions of Hash Functions; 2.2. Random Oracles; 2.3. Other Requirements for Hash Functions; 2.4. Summary; 3. Ordinary Hash Functions Versus Hash Function Families; 3.1. Ordinary Hash Functions; 3.1.1. Definitions and Implications of Security Properties; 3.2. Hash Functions Families; 4. What to Do about all the Cryptographic Hash Function Definitions?; 5. Moving Forward; 6. Conclusion; References; Appendix A. 7. Security Requirement De nitionsScalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects Y. M. Chee and C. J. Colbourn; 1. Introduction; 2. Testing Under a Generalized MAF Model; 3. Optimal Crosstalk Test Arrays; 4. Implementation; 4.1. Testing Data Buses; 4.2. Testing Address Buses; 5. Significance; 6. Conclusion; Acknowledgments; References; An Improved Distinguisher for Dragon J. Y. Cho and J. Pieprzyk; 1. Introduction; 2. A brief description of Dragon; 3. A linear distinguisher for Dragon; 3.1. Approximations of functions G and H 3.1.1. Approximations of the function H3.1.2. Approximations of the function G; 3.2. Linear approximations of modular addition; 3.3. Linear approximation of the function F; 3.3.1. The approximation of a0; 3.3.2. The approximation of e0; 3.4. Building the distinguisher; 3.5. Our results; 4. Improving the distinguisher; 4.1. Experiments; 5. Conclusion; Acknowledgment; References; Appendix A. Proof of Theorem 3.1; Appendix B. Proof of Corollary 3.1; Appendix C. Proof of Lemma 4.1; Constructing Perfect Hash Families Using a Greedy Algorithm C. J. Colbourn; 1. Introduction 2. Density and a Greedy Algorithm |
Record Nr. | UNINA-9910815423703321 |
New Jersey, : World Scientific, c2008 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|