Expander graphs are non-malleable codes

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

Dokumenter

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.

OriginalsprogEngelsk
Titel1st Conference on Information-Theoretic Cryptography, ITC 2020
RedaktørerYael Tauman Kalai, Adam D. Smith, Daniel Wichs
ForlagSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publikationsdato2020
Sider1-10
Artikelnummer6
ISBN (Elektronisk)9783959771511
DOI
StatusUdgivet - 2020
Begivenhed1st Conference on Information-Theoretic Cryptography, ITC 2020 - Virtual, Boston, USA
Varighed: 17 jun. 202019 jun. 2020

Konference

Konference1st Conference on Information-Theoretic Cryptography, ITC 2020
LandUSA
ByVirtual, Boston
Periode17/06/202019/06/2020
NavnLeibniz International Proceedings in Informatics, LIPIcs
Vol/bind163
ISSN1868-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


Ingen data tilgængelig

ID: 271818850