Expander graphs are non-malleable codes
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Dokumenter
- LIPIcs-ITC-2020-6
Forlagets udgivne version, 456 KB, PDF-dokument
Any d-regular graph on n vertices with spectral expansion ? satisfying n = ?(d3 log(d)/?) yields a O (?3d/2 ) -non-malleable code for single-bit messages in the split-state model.
Originalsprog | Engelsk |
---|---|
Titel | 1st Conference on Information-Theoretic Cryptography, ITC 2020 |
Redaktører | Yael Tauman Kalai, Adam D. Smith, Daniel Wichs |
Forlag | Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
Publikationsdato | 2020 |
Sider | 1-10 |
Artikelnummer | 6 |
ISBN (Elektronisk) | 9783959771511 |
DOI | |
Status | Udgivet - 2020 |
Begivenhed | 1st Conference on Information-Theoretic Cryptography, ITC 2020 - Virtual, Boston, USA Varighed: 17 jun. 2020 → 19 jun. 2020 |
Konference
Konference | 1st Conference on Information-Theoretic Cryptography, ITC 2020 |
---|---|
Land | USA |
By | Virtual, Boston |
Periode | 17/06/2020 → 19/06/2020 |
Navn | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Vol/bind | 163 |
ISSN | 1868-8969 |
Bibliografisk note
Funding Information:
Funding Peter Michael Reichstein Rasmussen: Supported in part by grant 16582, Basic Algorithms
Funding Information:
Research Copenhagen (BARC), from the VILLUM Foundation. Amit Sahai: Supported in part from a DARPA/ARL SAFEWARE award, NSF Frontier Award 1413955, and NSF grant 1619348, BSF grant 2012378, a Xerox Faculty Research Award, a Google Faculty Research Award, an equipment grant rom Intel, and an Okawa Foundation Research Grant. This material is based upon work supported by the Defense Advanced Research Projects Agency through the ARL under Contract W911NF-15-C-0205. The views expressed are those of the authors and do not reflect the official policy or position of the Department of Defense, the National Science Foundation, or the U.S. Government.
Publisher Copyright:
© Peter Michael Reichstein Rasmussen and Amit Sahai; licensed under Creative Commons License CC-BY
Antal downloads er baseret på statistik fra Google Scholar og www.ku.dk
ID: 271818850