Non-malleable codes from addictive combinatorics

Divesh Aggarwal, Yevgeniy Dodis, Shachar Lovett

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish (US)
Title of host publicationSymposium on Theory of Computing (STOC)
StatePublished - Jun 2014

Cite this

Aggarwal, D., Dodis, Y., & Lovett, S. (2014). Non-malleable codes from addictive combinatorics. In Symposium on Theory of Computing (STOC)

Non-malleable codes from addictive combinatorics. / Aggarwal, Divesh; Dodis, Yevgeniy; Lovett, Shachar.

Symposium on Theory of Computing (STOC). 2014.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Aggarwal, D, Dodis, Y & Lovett, S 2014, Non-malleable codes from addictive combinatorics. in Symposium on Theory of Computing (STOC).
Aggarwal D, Dodis Y, Lovett S. Non-malleable codes from addictive combinatorics. In Symposium on Theory of Computing (STOC). 2014
Aggarwal, Divesh ; Dodis, Yevgeniy ; Lovett, Shachar. / Non-malleable codes from addictive combinatorics. Symposium on Theory of Computing (STOC). 2014.
@inproceedings{4396e526c4254c38b68d4855dcef98b9,
title = "Non-malleable codes from addictive combinatorics",
author = "Divesh Aggarwal and Yevgeniy Dodis and Shachar Lovett",
year = "2014",
month = "6",
language = "English (US)",
booktitle = "Symposium on Theory of Computing (STOC)",

}

TY - GEN

T1 - Non-malleable codes from addictive combinatorics

AU - Aggarwal, Divesh

AU - Dodis, Yevgeniy

AU - Lovett, Shachar

PY - 2014/6

Y1 - 2014/6

M3 - Conference contribution

BT - Symposium on Theory of Computing (STOC)

ER -