検索結果をRefWorksへエクスポートします。対象は1件です。
Export
RT Book, Whole SR Electronic DC OPAC T1 Advances in Cryptology - CRYPTO 2006 : 26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings / edited by Cynthia Dwork T2 Lecture Notes in Computer Science. ISSN:16113349 A1 Dwork, Cynthia A1 SpringerLink (Online service) YR 2006 FD 2006 SP XIV, 622 p K1 Cryptography K1 Data encryption (Computer science) K1 Electronic data processing -- Management K1 Computer networks K1 Operating systems (Computers) K1 Computers and civilization K1 Computer science -- Mathematics K1 Discrete mathematics K1 Cryptology K1 IT Operations K1 Computer Communication Networks K1 Operating Systems K1 Computers and Society K1 Discrete Mathematics in Computer Science ED 1st ed. 2006. PB Springer Berlin Heidelberg : Imprint: Springer PP Berlin, Heidelberg SN 9783540374336 LA English (英語) CL LCC:QA268 CL DC23:005.824 NO 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 NO HTTP:URL=https://doi.org/10.1007/11818175 NO 書誌ID=EB00001324; LK [E Book]https://doi.org/10.1007/11818175 OL 30