Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
From MaRDI portal
Publication:5458609
DOI10.1007/978-3-540-78967-3_27zbMath1149.94333OpenAlexW1490273987MaRDI QIDQ5458609
Serge Fehr, Ronald Cramer, Daniel Wichs, Carles Padró, Yevgeniy Dodis
Publication date: 15 April 2008
Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_27
Related Items (47)
Robustly reusable fuzzy extractor with imperfect randomness ⋮ LWE without modular reduction and improved side-channel attacks against BLISS ⋮ Construction and nonexistence of strong external difference families ⋮ Binary AMD Circuits from Secure Multiparty Computation ⋮ Interactive communication with unknown noise rate ⋮ A generic construction of fuzzy signature ⋮ Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Existence and non-existence results for strong external difference families ⋮ Detection of Algebraic Manipulation in the Presence of Leakage ⋮ Splitting authentication codes with perfect secrecy: new results, constructions and connections with algebraic manipulation detection codes ⋮ Detecting Algebraic Manipulation in Leaky Storage Systems ⋮ Unconditionally Secure Revocable Storage: Tight Bounds, Optimal Construction, and Robustness ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Arithmetic sketching ⋮ Disjoint difference families and their applications ⋮ Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy ⋮ Algebraic manipulation detection codes ⋮ Robustly reusable fuzzy extractor from standard assumptions ⋮ Weighted external difference families and R-optimal AMD codes ⋮ How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks ⋮ Codes for Detection of Limited View Algebraic Tampering ⋮ An Improved Robust Fuzzy Extractor ⋮ Nonexistence of strong external difference families in abelian groups of order being product of at most three primes ⋮ Non-Malleable Codes from Additive Combinatorics ⋮ On encoding polynomials for strong algebraic manipulation detection codes ⋮ New existence and nonexistence results for strong external difference families ⋮ Efficient Error-Correcting Codes for Sliding Windows ⋮ Efficient robust secret sharing from expander graphs ⋮ Non-malleable coding against bit-wise and split-state tampering ⋮ Nearly optimal robust secret sharing ⋮ Characterising bimodal collections of sets in finite groups ⋮ Reusable fuzzy extractors for low-entropy distributions ⋮ Round-optimal secure multi-party computation ⋮ On the equivalence of authentication codes and robust (2, 2)-threshold schemes ⋮ Reusable fuzzy extractor from the decisional Diffie-Hellman assumption ⋮ Optimal Computational Split-state Non-malleable Codes ⋮ Algebraic manipulation detection codes via highly nonlinear functions ⋮ Some results on generalized strong external difference families ⋮ Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families ⋮ Key Agreement from Close Secrets over Unsecured Channels ⋮ Going beyond dual execution: MPC for functions with efficient verification ⋮ On Complete Primitives for Fairness ⋮ On Related-Secret Pseudorandomness ⋮ A new class of security oriented error correcting robust codes ⋮ On optimal weak algebraic manipulation detection codes and weighted external difference families ⋮ Nearly optimal robust secret sharing against rushing adversaries
This page was built for publication: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
