最 低 价：￥576.30
| 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 research forum available. The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes -proceedings (published in time for the respective conference) -post-proceedings (consisting of thoroughly revised final full papers) -research monographs (which may be based on outstanding PhD work,research projects, technical reports, etc.) |
| Efficient Collision Search Attacks on SHA-0 Finding Collisions in the Full SHA-1 Pebbling and Proofs of Work Composition Does Not Imply Adaptive Security On the Discrete Logarithm Problem on Algebraic Tori A Practical Attack on a Braid Group Based Cryptographic Protocol The Conditional Correlation Attack: A Practical Attack on Bluetooth Encryption Unconditional Characterizations of Non-interactive Zero-Knowledge Impossibility and Feasibility Results for Zero Knowledge with Public Keys Communication-Efcient Non-interactive Proofs of Knowledge with Online Extractors A Formal Treatment of Onion Routing Simple and Efficient Shuffling with Provable Correctness and ZK Privacy Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions Private Searching on Streaming Data Privacy-Preserving Set Operations Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys Generic Transformation for Scalable Broadcast Encryption Schemes Authenticating Pervasive Devices with Human Protocols Secure Communications over Insecure Channels Based on Short Authenticated Strings On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes Black-Box Secret Sharing from Primitive Sets in Algebraic Number Fields Secure Computation Without Authentication Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems …… Author Index |
内容加载中，请稍后...
商品评论（0条）