Advances in Cryptology - CRYPTO 2006  26th Annual International Cryptology Conference, Santa Barbara, California, USA, August 20-24, 2006, Proceedings /  [electronic resource] : 
edited by Cynthia Dwork. 
 - 1st ed. 2006. 
 - XIV, 622 p.  online resource. 
 - Lecture Notes in Computer Science,  4117  1611-3349 ; .
 - Lecture Notes in Computer Science,  4117 .
<br/><br/>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 andSecure 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. 
<br/><br/><label>ISBN: </label>9783540374336 
<br/><br/><label>Standard No.: </label>10.1007/11818175  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Cryptography.<br/>Data encryption (Computer science).<br/>Electronic data processing--Management.<br/>Computer networks .<br/>Operating systems (Computers).<br/>Computers and civilization.<br/>Computer science--Mathematics.<br/>Discrete mathematics.<br/>Cryptology.<br/>IT Operations.<br/>Computer Communication Networks.<br/>Operating Systems.<br/>Computers and Society.<br/>Discrete Mathematics in Computer Science.
<br/><br/><label>LC Class. No.: </label>QA268 
<br/><br/><label>Dewey Class. No.: </label>005.824