Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Journal of Computer and System Sciences
Perfectly one-way probabilistic hash functions (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
How to Fool an Unbounded Adversary with a Short Key
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Practical Protocol for Advantage Distillation and Information Reconciliation
Designs, Codes and Cryptography
Encryption against Storage-Bounded Adversaries from On-Line Strong Extractors
Journal of Cryptology
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Maintaining secrecy when information leakage is unavoidable
Maintaining secrecy when information leakage is unavoidable
Entropic security and the encryption of high entropy messages
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Obfuscated databases and group privacy
Proceedings of the 12th ACM conference on Computer and communications security
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On Pseudorandom Generators with Linear Stretch in NC0
Computational Complexity
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Structural signatures for tree data structures
Proceedings of the VLDB Endowment
Towards practical biometric key generation with randomized biometric templates
Proceedings of the 15th ACM conference on Computer and communications security
The practical subtleties of biometric key generation
SS'08 Proceedings of the 17th conference on Security symposium
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
On cryptography with auxiliary input
Proceedings of the forty-first annual ACM symposium on Theory of computing
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Obfuscation for cryptographic purposes
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Securely obfuscating re-encryption
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secure identification and QKD in the bounded-quantum-storage model
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
The candidate key protocol for generating secret shared keys from similar sensor data streams
ESAS'07 Proceedings of the 4th European conference on Security and privacy in ad-hoc and sensor networks
Randomness extraction via δ-biased masking in the presence of a quantum attacker
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Saving private randomness in one-way functions and pseudorandom generators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Instantiability of RSA-OAEP under chosen-plaintext attack
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On strong simulation and composable point obfuscation
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Signatures resilient to continual leakage on memory and computation
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Secure authentication from a weak key, without leaking information
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Cryptography in constant parallel time
Cryptography in constant parallel time
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
On fuzzy syndrome hashing with LDPC coding
Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Better short-seed quantum-proof extractors
Theoretical Computer Science
Obfuscation of hyperplane membership
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On the (im)possibility of obfuscating programs
Journal of the ACM (JACM)
Secure obfuscation for encrypted signatures
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On pseudorandom generators with linear stretch in NC0
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
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Generic constructions of biometric identity based encryption systems
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
Functional re-encryption and collusion-resistant obfuscation
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Security notions of biometric remote authentication revisited
STM'11 Proceedings of the 7th international conference on Security and Trust Management
On the concept of software obfuscation in computer security
ISC'07 Proceedings of the 10th international conference on Information Security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Randomness-Dependent message security
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Black-box obfuscation for d-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science
Secure outsourced computation of iris matching
Journal of Computer Security
| Hi-index | 0.00 |
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak a significant amount of information about W --- that is, from the adversary's point of view, the entropy of W will drop significantly. Nevertheless, we construct schemes with which Alice and Bob can prevent an adversary from learning any useful information about W. Specifically, if the entropy of W is sufficiently high, then there is no function f(W) which the adversary can learn from the error-correction information with significant probability.This leads to several new results: (a) the design of noise-tolerant "perfectly one-way" hash functions in the sense of Canetti et al. [7], which in turn leads to obfuscation of proximity queries for high entropy secrets W; (b) private fuzzy extractors [11], which allow one to extract uniformly random bits from noisy and nonuniform data W, while also insuring that no sensitive information about W is leaked; and (c) noise tolerance and stateless key re-use in the Bounded Storage Model, resolving the main open problem of Ding [10].The heart of our constructions is the design of strong randomness extractors with the property that the source W can be recovered from the extracted randomness and any string W' which is close to W.