Authentication theory/coding theory
Proceedings of CRYPTO 84 on Advances in cryptology
How to share a secret with cheaters
Journal of Cryptology
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Perfectly secure message transmission
Journal of the ACM (JACM)
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Lower bounds for robust secret sharing schemes
Information Processing Letters
Robust vector space secret sharing schemes
Information Processing Letters
Communications of the ACM
Detection of Cheaters in Vector Space Secret Sharing Schemes
Designs, Codes and Cryptography
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure
Designs, Codes and Cryptography
On the (non)Universality of the One-Time Pad
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Exposure-resilient cryptography
Exposure-resilient cryptography
Reusable cryptographic fuzzy extractors
Proceedings of the 11th ACM conference on Computer and communications security
Optimum secret sharing scheme secure against cheating
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Information-theoretic security without an honest majority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Anonymous quantum communication
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Secure remote authentication using biometric data
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Robust fuzzy extractors and authenticated key agreement from close secrets
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
An Improved Robust Fuzzy Extractor
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Key Agreement from Close Secrets over Unsecured Channels
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Non-malleable extractors and symmetric key cryptography from weak secrets
Proceedings of the forty-first annual ACM symposium on Theory of computing
Secure communication with a Byzantine relay
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Codes against online adversaries
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Information-theoretically secret key generation for fading wireless channels
IEEE Transactions on Information Forensics and Security
A key binding system based on n-nearest minutiae structure of fingerprint
Pattern Recognition Letters
Almost optimum t-cheater identifiable secret sharing schemes
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
On related-secret pseudorandomness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Quantum readout of physical unclonable functions
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Identifying cheaters without an honest majority
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Unconditionally-Secure robust secret sharing with compact shares
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Public key encryption against related key attacks
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
RKA security beyond the linear barrier: IBE, encryption and signatures
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Proceedings of the 2nd International Workshop on Hardware and Architectural Support for Security and Privacy
Proceedings of the 3rd international workshop on Trustworthy embedded devices
Capacity of non-malleable codes
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
Consider an abstract storage device Σ(G) that can hold a single element x from a fixed, publicly known finite group G. Storage is private in the sense that an adversary does not have read access to Σ(G) at all. However, Σ(G) is non-robust in the sense that the adversary can modify its contents by adding some offset Δ ∈ G. Due to the privacy of the storage device, the value Δ can only depend on an adversary's a priori knowledge of x. We introduce a new primitive called an algebraic manipulation detection (AMD) code, which encodes a source s into a value x stored on Σ(G) so that any tampering by an adversary will be detected. We give a nearly optimal construction of AMD codes, which can flexibly accommodate arbitrary choices for the length of the source s and security level. We use this construction in two applications: - We show how to efficiently convert any linear secret sharing scheme into a robust secret sharing scheme, which ensures that no unqualified subset of players can modify their shares and cause the reconstruction of some value s′ ≠ s. - We show how to build nearly optimal robust fuzzy extractors for several natural metrics. Robust fuzzy extractors enable one to reliably extract and later recover random keys from noisy and non-uniform secrets, such as biometrics, by relying only on non-robust public storage. In the past, such constructions were known only in the random oracle model, or required the entropy rate of the secret to be greater than half. Our construction relies on a randomly chosen common reference string (CRS) available to all parties.