You have Guest access.
Log In
Cynthia Dwork
Front matter
1-21
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
22-40
On the Power of the Randomized Iterate
41-59
Strengthening Digital Signatures Via Randomized Hashing
60-77
Round-Optimal Composable Blind Signatures in the Common Reference String Model
78-96
On Signatures of Knowledge
97-111
Non-interactive Zaps and New Techniques for NIZK
112-130
Rankin’s Constant and Blockwise Lattice Reduction
131-141
Lattice-Based Cryptography
142-159
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
160-179
Mitigating Dictionary Attacks on Password-Protected Local Storage
180-197
Rationality and Adversarial Behavior in Multi-party Computation
198-213
When Random Sampling Preserves Privacy
214-231
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
232-250
Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets
251-270
On Forward-Secure Storage
271-289
Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
290-307
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
308-325
Fast Algorithms for the Free Riders Problem in Broadcast Encryption
326-344
The Number Field Sieve in the Medium Prime Case
345-356
Inverting HFE Is Quasipolynomial
357-372
Cryptanalysis of 2R− Schemes
373-392
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
393
Cryptographic Protocols for Electronic Voting
394-408
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
409-426
Random Selection with an Adversarial Majority
427-444
Oblivious Transfer and Linear Functions
445-462
On Expected Constant-Round Protocols for Byzantine Agreement
463-482
Robust Multiparty Computation with Linear Communication Complexity
483-500
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
501-520
Scalable Secure Multiparty Computation
521-536
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
537-554
Automated Security Proofs with Sequences of Games
555-569
On Robust Combiners for Private Information Retrieval and Other Primitives
570-583
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
584-601
On the Higher Order Nonlinearities of Algebraic Immune Functions
602-619
New Proofs for NMAC and HMAC: Security Without Collision-Resistance
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info