Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudo-random functions and factoring (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The free haven project: distributed anonymous storage service
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Some facets of complexity theory and cryptography: A five-lecture tutorial
ACM Computing Surveys (CSUR)
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
GEM: A Generic Chosen-Ciphertext Secure Encryption Method
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Persistent Turing Machines as a Model of Interactive Computation
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Strong Solutions to the Identification Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Quantum DNF Learnability Revisited
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Zero-Knowledge and Code Obfuscation
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Practical Construction and Analysis of Pseudo-Randomness Primitives
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
On Sufficient Randomness for Secure Public-Key Cryptosystems
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Lower bounds on the amount of randomness in private computation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Proactive secure message transmission in asynchronous networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Appraising two decades of distributed computing theory research
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
On interactive proofs with a laconic prover
Computational Complexity
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
More efficient PAC-learning of DNF with membership queries under the uniform distribution
Journal of Computer and System Sciences
ACM SIGACT News
Interactive and Probabilistic Proof of Mobile Code Safety
Automated Software Engineering
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Memorizable interactive proof and zero-knowledge proof systems
Journal of Computer Science and Technology
Logical verification and equational verification
ACM SIGACT News
NP-completeness for all computer science undergraduates: a novel project-based curriculum
Journal of Computing Sciences in Colleges
Quantum lower bounds for the Goldreich-Levin problem
Information Processing Letters
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Theoretical Computer Science
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Exploring confusion in product ciphers through regression analysis
Information Sciences: an International Journal
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Extending tamper-proof hardware security to untrusted execution environments
CARDIS'02 Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Defending against statistical steganalysis
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Defending against statistical steganalysis
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
TestU01: A C library for empirical testing of random number generators
ACM Transactions on Mathematical Software (TOMS)
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
The unified theory of pseudorandomness: guest column
ACM SIGACT News
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
LEARNING RANDOM NUMBERS: A MATLAB ANOMALY
Applied Artificial Intelligence
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
Improved MACs from Differentially-Uniform Permutations
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Games for extracting randomness
Proceedings of the 5th Symposium on Usable Privacy and Security
Weakening the Dolev-Yao model through probability
Proceedings of the 2nd international conference on Security of information and networks
Quantum lower bounds for the Goldreich--Levin problem
Information Processing Letters
Improved security analysis of XEX and LRW modes
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Cryptographic and physical zero-knowledge proof systems for solutions of sudoku puzzles
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Tweakable enciphering schemes from hash-sum-expansion
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Randomness: a computational complexity perspective
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Privacy-preserving record linkage
PSD'10 Proceedings of the 2010 international conference on Privacy in statistical databases
Distinguishing distributions using Chernoff information
ProvSec'10 Proceedings of the 4th international conference on Provable security
On parallel composition of zero-knowledge proofs with black-box quantum simulators
Quantum Information & Computation
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs
Studies in complexity and cryptography
A note on Yao's theorem about pseudo-random generators
Cryptography and Communications
Cryptography in constant parallel time
Cryptography in constant parallel time
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Provably secure MACs from differentially-uniform permutations and AES-Based implementations
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
An efficient parallel repetition theorem
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Subspace-based technique for speech encryption
Digital Signal Processing
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Parallel and concurrent security of the HB and HB+ protocols
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Quixote: supporting group decisions through the web
TCGOV'05 Proceedings of the 2005 international conference on E-Government: towards Electronic Democracy
The power and weakness of randomness in computation
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hybrid symmetric encryption using known-plaintext attack-secure components
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Building blockcipher from tweakable blockcipher: extending FSE 2009 proposal
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
Mining statistically significant substrings using the chi-square statistic
Proceedings of the VLDB Endowment
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs
ACM Transactions on Computation Theory (TOCT)
New bounds for PMAC, TMAC, and XCBC
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
| Hi-index | 0.02 |
From the Publisher:This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.