Advances in Cryptology - CRYPTO 2006 : 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings / edited by Cynthia Dwork
(Lecture Notes in Computer Science. ISSN:16113349 ; 4117)
データ種別 | 電子ブック |
---|---|
版 | 1st ed. 2006. |
出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
出版年 | 2006 |
大きさ | XIV, 622 p : online resource |
著者標目 | Dwork, Cynthia editor SpringerLink (Online service) |
書誌詳細を非表示
一般注記 | Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs -- On the Power of the Randomized Iterate -- Strengthening Digital Signatures Via Randomized Hashing -- Round-Optimal Composable Blind Signatures in the Common Reference String Model -- On Signatures of Knowledge -- Non-interactive Zaps and New Techniques for NIZK -- Rankin’s Constant and Blockwise Lattice Reduction -- Lattice-Based Cryptography -- A Method for Making Password-Based Key Exchange Resilient to Server Compromise -- Mitigating Dictionary Attacks on Password-Protected Local Storage -- Rationality and Adversarial Behavior in Multi-party Computation -- When Random Sampling Preserves Privacy -- Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models -- Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets -- On Forward-Secure Storage -- Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One -- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) -- Fast Algorithms for the Free Riders Problem in Broadcast Encryption -- The Number Field Sieve in the Medium Prime Case -- Inverting HFE Is Quasipolynomial -- Cryptanalysis of 2R? Schemes -- Receipt-Free Universally-Verifiable Voting with Everlasting Privacy -- Cryptographic Protocols for Electronic Voting -- Asymptotically Optimal Two-Round Perfectly Secure Message Transmission -- Random Selection with an Adversarial Majority -- Oblivious Transfer and Linear Functions -- On Expected Constant-Round Protocols for Byzantine Agreement -- Robust Multiparty Computation with Linear Communication Complexity -- On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation -- Scalable Secure Multiparty Computation -- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields -- Automated Security Proofs with Sequences of Games -- On Robust Combiners for Private Information Retrieval and Other Primitives -- On the Impossibility of Efficiently Combining Collision Resistant Hash Functions -- On the Higher Order Nonlinearities of Algebraic Immune Functions -- New Proofs for NMAC and HMAC: Security Without Collision-Resistance HTTP:URL=https://doi.org/10.1007/11818175 |
---|---|
件 名 | LCSH:Cryptography LCSH:Data encryption (Computer science) LCSH:Electronic data processing -- Management 全ての件名で検索 LCSH:Computer networks LCSH:Operating systems (Computers) LCSH:Computers and civilization LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics FREE:Cryptology FREE:IT Operations FREE:Computer Communication Networks FREE:Operating Systems FREE:Computers and Society FREE:Discrete Mathematics in Computer Science |
分 類 | LCC:QA268 DC23:005.824 |
書誌ID | EB00001324 |
ISBN | 9783540374336 |
類似資料
この資料の利用統計
このページへのアクセス回数:1回
※2019年3月27日以降
全貸出数:0回
(1年以内の貸出:0回)
※2019年3月27日以降