| The LNCS series reports state-of-the-art results in computer science research,development,and education,at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community,with numerous individuals,as well as with prestigious organizations and societies,LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS,including its subseries LNAI,spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.) |
| Attacks on Hash Functions Finding SHA-1 Characteristics: General Results and Applications Improved Collision Search for SHA-0 Forgery and Partial Key-Recovery Attacks on HMAC and NMAC Using Hash Collisions Stream Ciphers and Boolean Functions New Guess-and-Determine Attack on the Self-Shrinking Generator On the (In)security of Stream Ciphers Based on Arrays and Modular Addition Construction and Analysis of Boolean Functions of 2t + 1 Variables with Maximum Algebraic Immunity Biometrics and ECC Computation Secure Sketch for Biometric Templates The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography Extending Scalar Multiplication Using Double Bases ID-Based Schemes HIBE With Short Public Parameters Without Random Oracle Forward-Secure and Searchable Broadcast Encryption with Short Ciphertexts and Private Keys On the Generic Construction of Identity-Based Signatures with Additional Properties Public-Key Schemes On the Provable Security of an Efficient RSA-Based Pseudorandom Generator On the Security of OAEP Relationship Between Standard Model Plaintext Awareness and Message Hiding RSA and Factorization On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms Trading One-Wayness Against Chosen-Cipherte~t Security in Factoring-Based Encryption A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants Construction of Hash Function Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding …… Protocols Block Ciphers Signatures Author Index |
内容加载中，请稍后...
商品评论（0条）