Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
Enumeration of Correlation Immune Boolean Functions
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
Error Detection and Authentication in Quantum Key Distribution
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
A Brief Outline of Research on Correlation Immune Functions
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Linear Codes in Constructing Resilient Functions with High Nonlinearity
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Nonlinear Vector Resilient Functions
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
How to Reduce Your Enemy's Information (Extended Abstract)
CRYPTO '85 Advances in Cryptology
Bounds for Resilient Functions and Orthogonal Arrays
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
On Perfect and Adaptive Security in Exposure-Resilient Cryptography
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
On Resilient Boolean Functions with Maximal Possible Nonlinearity
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
On the Constructing of Highly Nonlinear Resilient Boolean Functions by Means of Special Matrices
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Upper Bound on the Number of m-Resilient Boolean Functions
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improved Construction of Nonlinear Resilient S-Boxes
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
New Constructions of Resilient Boolean Functions with Maximal Nonlinearity
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
IEEE Transactions on Computers
Cryptography with constant computational overhead
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear Slide Attacks on the KeeLoq Block Cipher
Information Security and Cryptology
Post-Processing Functions for a Biased Physical Random Number Generator
Fast Software Encryption
Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Increasing the Output Length of Zero-Error Dispersers
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Corruption and Recovery-Efficient Locally Decodable Codes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Affine dispersers from subspace polynomials
Proceedings of the forty-first annual ACM symposium on Theory of computing
Minimum Distance between Bent and Resilient Boolean Functions
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Extracting Computational Entropy and Learning Noisy Linear Functions
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Analysis and construction of correctors
IEEE Transactions on Information Theory
Wiretap channel type II with an active eavesdropper
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Construction of high degree resilient S-boxes with improved nonlinearity
Information Processing Letters
Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors
Journal of the ACM (JACM)
Improving the Robustness of Ring Oscillator TRNGs
ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Construction of t-resilient functions over a finite alphabet
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Almost k-wise independent sample spaces and their cryptologic applications
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
On the reversibility of oblivious transfer
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Quantum oblivious mutual identification
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
On nonlinear resilient functions
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Exposure-resilient functions and all-or-nothing transforms
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Public-key cryptography from different assumptions
Proceedings of the forty-second ACM symposium on Theory of computing
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Deterministic extractors for small-space sources
Journal of Computer and System Sciences
Deterministic extractors for independent-symbol sources
IEEE Transactions on Information Theory
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Correlation extractors and their applications
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Three XOR-lemmas - an exposition
Studies in complexity and cryptography
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Bounded Independence Fools Halfspaces
SIAM Journal on Computing
On the impossibility of extracting classical randomness using a quantum computer
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Deterministic extractors for independent-symbol sources
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Results on almost resilient functions
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Our data, ourselves: privacy via distributed noise generation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
A multi-stage secret sharing scheme using all-or-nothing transform approach
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Separating sources for encryption and secret sharing
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Characterisations of extended resiliency and extended immunity of s-boxes
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Randomness condensers for efficiently samplable, seed-dependent sources
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Construction of highly nonlinear resilient S-boxes with given degree
Designs, Codes and Cryptography
The Complexity of Distributions
SIAM Journal on Computing
Improving the Hadamard extractor
Theoretical Computer Science
Generalized correlation analysis of Vectorial Boolean functions
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Robust pseudorandom generators
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Code constructions and existence bounds for relative generalized Hamming weight
Designs, Codes and Cryptography
| Hi-index | 0.12 |
We consider the following adversarial situation. Let n, m and t be arbitrary integers, and let f : {0, 1}n → {0, 1}m be a function. An adversary, knowing the function f, sets t of the n input bits, while the rest (n-t input, bits) are chosen at random (independently and with uniform probability distribution) The adversary tries to prevent the outcome of f from being uniformly distributed in {0, 1}m. The question addressed is for what values of n, m and t does the adversary necessarily fail in biasing the outcome of f : {0,1}n → {0, 1}m, when being restricted to set t of the input bits of f. We present various lower and upper bounds on m's allowing an affirmative answer. These bounds are relatively close for t ≤ n/3 and for t ≥ 2n/3. Our results have applications in the fields of faulttolerance and cryptography.