DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Averaging argument
Averaging argument
On the Foundations of Cryptography∗
Draft Lecture Notes
How to Encipher Messages on a Small Domain Deterministic Encryption and the Thorp Shuffle
Stdin (Ditroff)
On One-Way Functions and Kolmogorov Complexity
On One-Way Functions and Kolmogorov Complexity
Provably Secure Steganography
Deterministic Encryption with the Thorp Shuffle
Thesis Proposal: Toward a Theory of Steganography
Multi Collision Resistant Hash Functions and Their Applications∗
Simultaneous Secrecy and Reliability Amplification for a General Channel
Deterministic Encryption: Definitional Equivalences and Constructions Without Random Oracles
Cryptographic Hashing from Strong One-Way Functions∗ Or: One-Way Product Functions and Their Applications
Lower Bounds on Obfuscation from All-Or-Nothing Encryption Primitives
Cryptography
CBC Macs for Arbitrary-Length Messages: the Three-Key Constructions
Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions
Message Authentication Codes by JOHN R
Top View
Indistinguishable Proofs of Work Or Knowledge
Homomorphic Encryption: from Private-Key to Public-Key
A Course in Cryptography
Foundations of Cryptography 89-856
Chapter on Cryptography in Arora Barak
COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS and THEIR APPLICATIONS Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz
An Intensive Introduction to Cryptography
Generic Case Complexity and One-Way Functions
Computational Indistinguishability Amplification: Tight Product
1 Introduction
Bounds on the Efficiency of Generic Cryptographic
3-Message Zero Knowledge Against Human Ignorance
Multi-Key Searchable Encryption, Revisited
Correlation Intractability Vs. One-Wayness
Fragments of a Chapter on Encryption Schemes
On the Power of Nonuniformity in Proofs of Security
10 Public Key Cryptography
Multi-Collision Resistance: a Paradigm for Keyless Hash Functions
Chosen-Ciphertext Security Via Correlated Products∗
Chosen-Ciphertext Security Via Correlated Products
Public-Key Encryption Schemes with Auxiliary Inputs
Optimally Secure Block Ciphers from Ideal Primitives⋆
The Security of Multiple Encryption in the Ideal Cipher Model
Password Cracking: the Effect of Hash Function Bias on the Average
Bounds on the Efficiency of Generic Cryptographic
Efficient Arguments Without Short Pcps∗
A Note on Black-Box Separations for Indistinguishability Obfuscation
Fragments of a Chapter on Encryption Schemes
Foundations of Cryptography 89-856
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity∗
Efficient and Optimally Secure Key-Length Extension for Block
Proofs, Arguments, and Zero-Knowledge1
New Implications and Improved Efficiency of Constructions Based on One-Way Functions
Modern Cryptography, Probabilistic Proofs and Pseudorandomness