Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Non-malleable extractors and symmetric key cryptography from weak secrets - MaRDI portal

Non-malleable extractors and symmetric key cryptography from weak secrets

From MaRDI portal
Publication:5172755

DOI10.1145/1536414.1536496zbMath1304.94048OpenAlexW2140805804MaRDI QIDQ5172755

Daniel Wichs, Yevgeniy Dodis

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1536414.1536496




Related Items (24)

Constructing locally leakage-resilient linear secret-sharing schemesLWE without modular reduction and improved side-channel attacks against BLISSLocal Correlation Breakers and Applications to Three-Source Extractors and MergersInteractive non-malleable codesPrivacy amplification from non-malleable codesWireless-channel key exchangeAlgebraic restriction codes and their applicationsExtractors: low entropy requirements colliding with non-malleabilityA new approach to efficient non-malleable zero-knowledgeNonmalleable digital lockers and robust fuzzy extractors in the plain modelComputational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropyRobustly reusable fuzzy extractor from standard assumptionsNonmalleable Extractors and Codes, with Their Many Tampered ExtensionsComputational fuzzy extractorsNon-Malleable Codes from Additive CombinatoricsNon-malleable coding against bit-wise and split-state tamperingPrivacy amplification with asymptotically optimal entropy lossUnnamed ItemA unified approach to deterministic encryption: new constructions and a connection to computational entropyLow error efficient computational extractors in the CRS modelUnnamed ItemExplicit two-source extractors and resilient functionsAdditive Combinatorics: With a View Towards Computer Science and Cryptography—An ExpositionNon-malleability against polynomial tampering




This page was built for publication: Non-malleable extractors and symmetric key cryptography from weak secrets