year |
venue |
title |
pages |

2011 | asiacrypt | Program Obfuscation with Leaky Hardware | 722-739 |

2011 | asiacrypt | Counting Points on Genus 2 Curves with Real Multiplication | 504-519 |

2011 | asiacrypt | A Framework for Practical Universally Composable Zero-Knowledge Protocols | 449-467 |

2011 | asiacrypt | Structure Preserving CCA Secure Encryption and Applications | 89-106 |

2011 | asiacrypt | The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy | 686-701 |

2011 | asiacrypt | The Preimage Security of Double-Block-Length Compression Functions | 233-251 |

2011 | asiacrypt | Polly Cracker, Revisited | 179-196 |

2011 | asiacrypt | Rebound Attack on JH42 | 252-269 |

2011 | asiacrypt | Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol | 372-389 |

2011 | asiacrypt | Practical Key-Recovery for All Possible Parameters of SFLASH | 667-685 |

2011 | asiacrypt | Constant-Round Private Function Evaluation with Linear Complexity | 556-571 |

2011 | asiacrypt | An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware | 327-343 |

2011 | asiacrypt | Second-Order Differential Collisions for Reduced SHA-256 | 270-287 |

2011 | asiacrypt | Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security | 572-589 |

2011 | asiacrypt | Biclique Cryptanalysis of the Full AES | 344-371 |

2011 | asiacrypt | Finding SHA-2 Characteristics: Searching through a Minefield of Contradictions | 288-307 |

2011 | asiacrypt | Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge | 390-406 |

2011 | asiacrypt | On the Joint Security of Encryption and Signature, Revisited | 161-178 |

2011 | asiacrypt | Lower and Upper Bounds for Deniable Public-Key Encryption | 125-142 |

2011 | asiacrypt | BiTR: Built-in Tamper Resilience | 740-758 |

2011 | asiacrypt | Efficient Zero-Knowledge Arguments from Two-Tiered Homomorphic Commitments | 431-448 |

2011 | asiacrypt | Functional Encryption for Inner Product Predicates from Learning with Errors | 21-40 |

2011 | asiacrypt | Two Provers in Isolation | 407-430 |

2011 | asiacrypt | Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security | 468-485 |

2011 | asiacrypt | Cryptanalysis of ARMADILLO2 | 308-326 |

2011 | asiacrypt | Secure Communication in Multicast Graphs | 538-555 |

2011 | asiacrypt | Separating Short Structure-Preserving Signatures from Non-interactive Assumptions | 628-646 |

2011 | asiacrypt | Cryptography Secure against Related-Key Attacks and Tampering | 486-503 |

2011 | asiacrypt | Leakage-Resilient Cryptography from the Inner-Product Extractor | 702-721 |

2011 | asiacrypt | Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$ | 107-124 |

2011 | asiacrypt | Computational Verifiable Secret Sharing Revisited | 590-609 |

2011 | asiacrypt | Natural Generalizations of Threshold Secret Sharing | 610-627 |

2011 | asiacrypt | Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security | 70-88 |

2011 | asiacrypt | Random Oracles in a Quantum World | 41-69 |

2011 | asiacrypt | BKZ 2.0: Better Lattice Security Estimates | 1-20 |

2011 | asiacrypt | Bridging Broadcast Encryption and Group Key Agreement | 143-160 |

2011 | asiacrypt | Noiseless Database Privacy | 215-232 |

2011 | asiacrypt | Short Signatures from Weaker Assumptions | 647-666 |

2011 | asiacrypt | Oblivious RAM with O((logN)3) Worst-Case Cost | 197-214 |

2011 | asiacrypt | On the Efficiency of Bit Commitment Reductions | 520-537 |

2011 | asiacrypt | Advances in Cryptology - ASIACRYPT 2011 - 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings | |

2011 | ches | On the Power of Fault Sensitivity Analysis and Collision Side-Channel Attacks in a Combined Setting | 292-311 |

2011 | ches | Meet-in-the-Middle and Impossible Differential Fault Analysis on AES | 274-291 |

2011 | ches | FPGA Implementation of Pairings Using Residue Number System and Lazy Reduction | 421-441 |

2011 | ches | Higher-Order Glitches Free Implementation of the AES Using Secure Multi-party Computation Protocols | 63-78 |

2011 | ches | Fast Multi-precision Multiplication for Public-Key Cryptography on Embedded Microprocessors | 459-474 |

2011 | ches | Extractors against Side-Channel Attacks: Weak or Strong? | 256-272 |

2011 | ches | Small Public Keys and Fast Verification for $\mathcal{M}$ ultivariate $\mathcal{Q}$ uadratic Public Key Systems | 475-490 |

2011 | ches | Standardization Works for Security Regarding the Electromagnetic Environment | 273 |

2011 | ches | Recyclable PUFs: Logically Reconfigurable PUFs | 374-389 |

2011 | ches | High Speed Cryptoprocessor for η T Pairing on 128-bit Secure Supersingular Elliptic Curves over Characteristic Two Fields | 442-458 |

2011 | ches | Protecting AES with Shamir's Secret Sharing Scheme | 79-94 |

2011 | ches | Random Sampling for Short Lattice Vectors on Graphics Cards | 160-175 |

2011 | ches | Information Theoretic and Security Analysis of a 65-Nanometer DDSLL AES S-Box | 223-239 |

2011 | ches | Lightweight and Secure PUF Key Storage Using Limits of Machine Learning | 358-373 |

2011 | ches | Extreme Enumeration on GPU and in Clouds - - How Many Dollars You Need to Break SVP Challenges - | 176-191 |

2011 | ches | Breaking Mifare DESFire MF3ICD40: Power Analysis and Templates in the Real World | 207-222 |

2011 | ches | Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication | 108-123 |

2011 | ches | Modulus Fault Attacks against RSA-CRT Signatures | 192-206 |

2011 | ches | Piccolo: An Ultra-Lightweight Blockcipher | 342-357 |

2011 | ches | A Fast and Provably Secure Higher-Order Masking of AES S-Box | 95-107 |

2011 | ches | Throughput vs. Area Trade-offs in High-Speed Architectures of Five Round 3 SHA-3 Candidates Implemented Using Xilinx and Altera FPGAs | 491-506 |

2011 | ches | High-Speed High-Security Signatures | 124-142 |

2011 | ches | FPGA-Based True Random Number Generation Using Circuit Metastability with Adaptive Feedback Control | 17-32 |

2011 | ches | Thwarting Higher-Order Side Channel Analysis with Additive and Multiplicative Maskings | 240-255 |

2011 | ches | Efficient Hashing Using the AES Instruction Set | 507-522 |

2011 | ches | An Exploration of Mechanisms for Dynamic Cryptographic Instruction Set Extension | 1-16 |

2011 | ches | Generic Side-Channel Countermeasures for Reconfigurable Devices | 33-48 |

2011 | ches | MECCA: A Robust Low-Overhead PUF Using Embedded Memory Array | 407-420 |

2011 | ches | spongent: A Lightweight Hash Function | 312-325 |

2011 | ches | The LED Block Cipher | 326-341 |

2011 | ches | Improved Collision-Correlation Power Analysis on First Order Protected AES | 49-62 |

2011 | ches | To Infinity and Beyond: Combined Attack on ECC Using Points of Low Order | 143-159 |

2011 | ches | Uniqueness Enhancement of PUF Responses Based on the Locations of Random Outputting RS Latches | 390-406 |

2011 | ches | Cryptographic Hardware and Embedded Systems - CHES 2011 - 13th International Workshop, Nara, Japan, September 28 - October 1, 2011. Proceedings | |

2011 | crypto | Leftover Hash Lemma, Revisited | 1 |

2011 | crypto | Random Oracle Reducibility | 21 |

2011 | crypto | Time-Lock Puzzles in the Random Oracle Model | 39 |

2011 | crypto | Physically Uncloneable Functions in the Universal Composition Framework | 51 |

2011 | crypto | Computer-Aided Security Proofs for the Working Cryptographer | 71 |

2011 | crypto | Optimal Verification of Operations on Dynamic Sets | 91 |

2011 | crypto | Verifiable Delegation of Computation over Large Datasets | 110 |

2011 | crypto | Secure Computation on the Web: Computing without Simultaneous Interaction | 128 |

2011 | crypto | Memory Delegation | 147 |

2011 | crypto | Automatic Search of Attacks on Round-Reduced AES and Applications | 165 |

2011 | crypto | How to Improve Rebound Attacks | 184 |

2011 | crypto | A Cryptanalysis of PRINTcipher: The Invariant Subspace Attack | 202 |

2011 | crypto | The PHOTON Family of Lightweight Hash Functions | 219 |

2011 | crypto | Perfectly-Secure Multiplication for any t<n/3 | 237 |

2011 | crypto | The IPS Compiler: Optimizations, Variants and Concrete Efficiency | 255 |

2011 | crypto | $1/p$-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds | 273 |

2011 | crypto | Leakage-Resilient Zero Knowledge | 293 |

2011 | crypto | A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework | 311 |

2011 | crypto | Key-Evolution Schemes Resilient to Space-Bounded Leakage | 330 |

2011 | crypto | Generic Side-Channel Distinguishers: Improvements and Limitations | 348 |

2011 | crypto | Cryptography with Tamperable and Leaky Memory | 367 |

2011 | crypto | Merkle Puzzles in a Quantum World | 385 |

2011 | crypto | Classical Cryptographic Protocols in a Quantum World | 405 |

2011 | crypto | Position-Based Quantum Cryptography: Impossibility and Constructions | 423 |

2011 | crypto | Analyzing Blockwise Lattice Algorithms using Dynamical Systems | 441 |

2011 | crypto | Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions | 461 |

2011 | crypto | Tor and Circumvention: Lessons Learned | 481 |

2011 | crypto | Fully Homomorphic Encryption over the Integers with Shorter Public Keys | 483 |

2011 | crypto | Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages | 501 |

2011 | crypto | Bi-Deniable Public-Key Encryption | 521 |

2011 | crypto | Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting | 539 |

2011 | crypto | The Collision Security of Tandem-DM in the Ideal Cipher Model | 557 |

2011 | crypto | Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions | 575 |

2011 | crypto | A New Variant of PMAC: Beyond the Birthday Bound | 593 |

2011 | crypto | Authenticated and Misuse-Resistant Encryption of Key-Dependent Data | 607 |

2011 | crypto | Round Optimal Blind Signatures in the Standard Model | 627 |

2011 | crypto | Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups | 646 |

2011 | crypto | Constant-Rate Oblivious Transfer from Noisy Channels | 664 |

2011 | crypto | The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing | 682 |

2011 | crypto | Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials | 703 |

2011 | crypto | Inverting HFE Systems is Quasi-Polynomial for All Fields | 721 |

2011 | crypto | Smaller Decoding Exponents: Ball-Collision Decoding | 740 |

2011 | crypto | McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks | 758 |

2011 | crypto | Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings | online |

2011 | eurocrypt | The Arithmetic Codex: Theory and Applications | 1 |

2011 | eurocrypt | Lattice Reduction Algorithms: Theory and Practice | 2 |

2011 | eurocrypt | Efficient Authentication from Hard Learning Problems | 7 |

2011 | eurocrypt | Making NTRU as Secure as Worst-Case Problems over Ideal Lattices | 27 |

2011 | eurocrypt | Faster Explicit Formulas for Computing Pairings over Ordinary Curves | 48 |

2011 | eurocrypt | Pushing the Limits: A Very Compact and a Threshold Implementation of AES | 69 |

2011 | eurocrypt | Fully Leakage-Resilient Signatures | 89 |

2011 | eurocrypt | A Formal Study of Power Variability Issues and Side-Channel Attacks for Nanoscale Devices | 109 |

2011 | eurocrypt | Implementing Gentry's Fully-Homomorphic Encryption Scheme | 129 |

2011 | eurocrypt | Homomorphic Signatures for Polynomial Functions | 149 |

2011 | eurocrypt | Semi-Homomorphic Encryption and Multiparty Computation | 169 |

2011 | eurocrypt | Tight Proofs for Signature Schemes without Random Oracles | 189 |

2011 | eurocrypt | Adaptive Pseudo-Free Groups and Applications | 207 |

2011 | eurocrypt | Commuting Signatures and Verifiable Encryption | 224 |

2011 | eurocrypt | Secure Authentication from a Weak Key, Without Leaking Information | 246 |

2011 | eurocrypt | Secret Keys from Channel Noise | 266 |

2011 | eurocrypt | Almost Optimum t-Cheater Identifiable Secret Sharing Schemes | 284 |

2011 | eurocrypt | On Linear Hulls, Statistical Saturation Attacks, PRESENT and a Cryptanalysis of PUFFIN | 303 |

2011 | eurocrypt | Domain Extension for MACs Beyond the Birthday Barrier | 323 |

2011 | eurocrypt | Statistical Attack on RC4 | 343 |

2011 | eurocrypt | Improved Generic Algorithms for Hard Knapsacks | 364 |

2011 | eurocrypt | Two-output Secure Computation With Malicious Adversaries | 386 |

2011 | eurocrypt | Effcient Non-Interactive Secure Computation | 406 |

2011 | eurocrypt | Towards a Game Theoretic View of Secure Computation | 426 |

2011 | eurocrypt | Highly-Efficient Universally-Composable Commitments based on the DDH Assumption | 446 |

2011 | eurocrypt | Concurrent composition in the bounded quantum storage model | 467 |

2011 | eurocrypt | Careful with Composition: Limitations of the Indifferentiability Framework | 487 |

2011 | eurocrypt | Efficient Circuit-Size Independent Public Key Encryption with KDM Security | 507 |

2011 | eurocrypt | Key-Dependent Message Security: Generic Amplification and Completeness | 527 |

2011 | eurocrypt | Unbounded HIBE and Attribute-Based Encryption | 547 |

2011 | eurocrypt | Decentralizing Attribute-Based Encryption | 568 |

2011 | eurocrypt | Threshold and Revocation Cryptosystems via Extractable Hash Proofs | 589 |

2011 | eurocrypt | Deniable Encryption with Negligible Detection Probability: An Interactive Construction | 610 |

2011 | eurocrypt | Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings | online |

2011 | fse | Cryptanalysis of the Knapsack Generator | 188 |

2011 | fse | Attack on Broadcast RC4 Revisited | 199 |

2011 | fse | Boomerang Attacks on BLAKE-32 | 218 |

2011 | fse | Practical Partial-Collisions on the Compression Function of BMW | 238 |

2011 | fse | Higher-order differential properties of Keccak and Luffa | 252 |

2011 | fse | Cryptanalysis of PRESENT-like ciphers with secret S-boxes | 270 |

2011 | fse | A Single-Key Attack on the Full GOST Block Cipher | 290 |

2011 | fse | The Software Performance of Authenticated-Encryption Modes | 306 |

2011 | fse | Cryptanalysis of Hummingbird | 328 |

2011 | fse | The Additive Differential Probability of ARX | 342 |

2011 | fse | Linear Approximations of Addition Modulo $2^n-1$ | 359 |

2011 | fse | Meet-in-the-Middle Preimage Attacks on Hash Function Modes Instantiating AES | 378 |

2011 | fse | Known-Key Distinguishers for 11-Round Feistel Ciphers: Application to Collision Attacks on Their Hashing Modes | 397 |

2011 | fse | Fast Software Encryption - 18th International Workshop, FSE 2011, Lyngby, Denmark, February 13-16, 2011, Revised Selected Papers | online |

2011 | fse | Differential Cryptanalysis of Round-Reduced PRINTcipher: Computing Roots of Permutations | 1 |

2011 | fse | Search for Related-key Differential Characteristics in DES-like ciphers | 18 |

2011 | fse | Multiple Differential Cryptanalysis: Theory and Practice | 35 |

2011 | fse | Fast Correlation Attacks: Methods and Countermeasures | 55 |

2011 | fse | Distinguishers and Free-start Collisions on the Reduced-round SHAvite-3-256 Compression Function | 68 |

2011 | fse | An Improved Algebraic Attack on Hamsi-256 | 88 |

2011 | fse | Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function | 107 |

2011 | fse | On Cipher-Dependent Related-Key Attacks in the Ideal-Cipher Model | 128 |

2011 | fse | On the Security of Hash Functions Employing Blockcipher Postprocessing | 146 |

2011 | fse | Breaking Grain-128 with Dynamic Cube Attacks | 167 |

2011 | jofc | Possibility and Impossibility Results for Selective Decommitments | 470-516 |

2011 | jofc | Side-Channel Resistant Crypto for Less than 2, 300 GE | 322-345 |

2011 | jofc | Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves | 446-469 |

2011 | jofc | Short Undeniable Signatures Based on Group Homomorphisms | 545-587 |

2011 | jofc | Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer | 761-799 |

2011 | jofc | Glitch and Laser Fault Attacks onto a Secure AES Implementation on a SRAM-Based FPGA | 247-268 |

2011 | jofc | Secure Computation Without Authentication | 720-760 |

2011 | jofc | Guest Editorial | 245-246 |

2011 | jofc | Efficient Selective Identity-Based Encryption Without Random Oracles | 659-693 |

2011 | jofc | On the Security of Oscillator-Based Random Number Generators | 398-425 |

2011 | jofc | Breaking the Stream Ciphers F-FCSR-H and F-FCSR-16 in Real Time | 427-445 |

2011 | jofc | Tweakable Block Ciphers | 588-613 |

2011 | jofc | Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs | 517-544 |

2011 | jofc | Fault-Based Attack on Montgomery's Ladder Algorithm | 346-374 |

2011 | jofc | Secure Hardware Implementation of Nonlinear Functions in the Presence of Glitches | 292-321 |

2011 | jofc | Resource Fairness and Composability of Cryptographic Protocols | 615-658 |

2011 | jofc | Securely Obfuscating Re-Encryption | 694-719 |

2011 | jofc | Mutual Information Analysis: a Comprehensive Study | 269-291 |

2011 | jofc | Improved Ring Oscillator PUF: An FPGA-friendly Secure Primitive | 375-397 |

2011 | jofc | Efficient Non-Malleable Commitment Schemes | 203-244 |

2011 | jofc | An *L*(1/3) Discrete Logarithm Algorithm for Low Degree Curves | 24-41 |

2011 | jofc | Practical Collisions for EnRUPT | 1-23 |

2011 | jofc | Wildcarded Identity-Based Encryption | 42-82 |

2011 | jofc | Cryptanalysis of the Tillich-Zémor Hash Function | 148-156 |

2011 | jofc | Utility Dependence in Correct and Fair Rational Secret Sharing | 157-202 |

2011 | jofc | Universally Composable Symbolic Security Analysis | 83-147 |

2011 | pkc | Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures | 1 |

2011 | pkc | Homomorphic Network Coding Signatures in the Standard Model | 17 |

2011 | pkc | Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model | 35 |

2011 | pkc | Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization | 53 |

2011 | pkc | Generic Constructions for Chosen-Ciphertext Secure Attribute Based Encryption | 71 |

2011 | pkc | Expressive Key-Policy Attribute-Based Encryption with Constant-Size Ciphertexts | 90 |

2011 | pkc | Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three | 109 |

2011 | pkc | On the correct use of the negation map in the Pollard rho method | 128 |

2011 | pkc | Cryptanalysis of the RSA Subgroup from TCC 2005 | 147 |

2011 | pkc | (If) Size Matters: Size-Hiding Private Set Intersection | 156 |

2011 | pkc | Sub-Linear, Secure Comparison With Two Non-Colluding Parties | 174 |

2011 | pkc | Oblivious Transfer with Hidden Access Control Lists | 192 |

2011 | pkc | Public Key Cryptography - PKC 2011 - 14th International Conference on Practice and Theory in Public Key Cryptography, Taormina, Italy, March 6-9, 2011. Proceedings | online |

2011 | pkc | Chosen Ciphertext Secure Encryption under Factoring Assumption Revisited | 210 |

2011 | pkc | Chameleon All-But-One TDFs and Their Application to Chosen-Ciphertext Security | 228 |

2011 | pkc | Parallel Decryption Queries in Bounded Chosen Ciphertext Attacks | 246 |

2011 | pkc | Secure Blind Decryption | 265 |

2011 | pkc | New Developments in Leakage-Resilient Cryptography | 283 |

2011 | pkc | Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants | 441 |

2011 | pkc | Cryptanalysis of Cryptosystems Based on Non-commutative Skew Polynomials | 459 |

2011 | pkc | Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem | 473 |

2011 | pkc | Linear Recurring Sequences for the UOV Key Generation | 335 |

2011 | pkc | On the Impossibility of Instantiating PSS in the Standard Model | 351 |

2011 | pkc | On-line Non-transferable Signatures Revisited | 369 |

2011 | pkc | Round-Efficient Sub-linear Zero-Knowledge Arguments for Linear Algebra | 387 |

2011 | pkc | Signatures on Randomizable Ciphertexts | 403 |

2011 | pkc | Revocation for Delegatable Anonymous Credentials | 423 |

2011 | pkc | On the Security of a Bidirectional Proxy Re-Encryption Scheme from PKC 2010 | 284 |

2011 | pkc | Fully Secure Accountable-Authority Identity-Based Encryption | 296 |

2011 | pkc | One-Pass HMQV and Asymmetric Key-Wrapping | 317 |

2011 | tcc | Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings | online |

2011 | tcc | Input Locality and Hardness Amplification | 1 |

2011 | tcc | General Hardness Amplification of Predicates and Puzzles | 19 |

2011 | tcc | Security Amplification for the Cascade of Arbitrarily Weak PRPs: Tight Bounds via the Interactive Hardcore Lemma | 37 |

2011 | tcc | Dense Model Theorems and Their Applications | 55 |

2011 | tcc | Parallel Repetition for Leakage Resilience Amplification Revisited | 58 |

2011 | tcc | Achieving Leakage Resilience Through Dual System Encryption | 70 |

2011 | tcc | Signatures Resilient to Continual Leakage on Memory and Computation | 89 |

2011 | tcc | After-the-Fact Leakage in Public-Key Encryption | 107 |

2011 | tcc | One-Time Computable Self-Erasing Functions | 125 |

2011 | tcc | Perfectly Secure Oblivious RAM Without Random Oracles | 144 |

2011 | tcc | Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token | 164 |

2011 | tcc | Correlated-Input Secure Hash Functions | 182 |

2011 | tcc | Black-Box Circular-Secure Encryption Beyond Affine Functions | 201 |

2011 | tcc | Homomorphic Encryption: from Private-Key to Public-Key | 219 |

2011 | tcc | Identity-Based Encryption Secure Against Selective Opening Attack | 235 |

2011 | tcc | Functional Encryption: Definitions and Challenges | 253 |

2011 | tcc | Concurrent Non-Malleable Zero Knowledge with Adaptive Inputs | 274 |

2011 | tcc | Round-Optimal Password-Based Authenticated Key Exchange | 293 |

2011 | tcc | Bringing People of Different Beliefs Together to do UC | 311 |

2011 | tcc | Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer | 329 |

2011 | tcc | Practical Adaptive Oblivious Transfer from Simple Assumptions | 347 |

2011 | tcc | Completeness Theorems with Constructive Proofs for Finite Deterministic 2-Party Functions | 364 |

2011 | tcc | A Zero-One Law for Secure Multi-Party Computation with Ternary Outputs | 382 |

2011 | tcc | PCPs and the Hardness of Generating Private Synthetic Data | 400 |

2011 | tcc | Limits of Computational Differential Privacy in the Client/Server Setting | 417 |

2011 | tcc | Towards Privacy for Social Networks: A Zero-Knowledge Based Definition of Privacy | 432 |

2011 | tcc | On the Black-Box Complexity of Optimally-Fair Coin Tossing | 450 |

2011 | tcc | Tight Bounds for Classical and Quantum Coin Flipping | 468 |

2011 | tcc | Exploring the Limits of Common Coins Using Frontier Analysis of Protocols | 486 |

2011 | tcc | Limits on the Stretch of Non-Adaptive Constructions of Pseudo-Random Generators | 504 |

2011 | tcc | On the Complexity of Non-Adaptively Increasing the Stretch of Pseudorandom Generators | 522 |

2011 | tcc | Concurrent Security and Non-malleability | 540 |

2011 | tcc | (Nearly) Round-Optimal Black-Box Constructions of Commitments Secure Against Selective Opening Attacks | 541 |

2011 | tcc | Limits On The Power of Zero-Knowledge Proofs in Cryptographic Constructions | 559 |

2011 | tcc | Towards Non-Black-Box Lower Bounds in Cryptography | 579 |

2011 | tcc | On Black-Box Separations among Injective One-Way Functions | 597 |

2011 | tcc | Impossibility of Blind Signatures From One-Way Permutations | 615 |