Non-malleable Obfuscation

Ran Canetti; Mayank Varia

doi:10.1007/978-3-642-00457-5_6

Non-malleable Obfuscation

Ran Canetti^*, Mayank Varia

^*Corresponding author for this work

School of Computer Science

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

24 Scopus citations

Abstract

Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.

Original language	English
Title of host publication	Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings
Pages	73-90
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-00457-5_6
State	Published - 2009
Event	6th Theory of Cryptography Conference, TCC 2009 - San Francisco, CA, United States Duration: 15 Mar 2009 → 17 Mar 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5444 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th Theory of Cryptography Conference, TCC 2009
Country/Territory	United States
City	San Francisco, CA
Period	15/03/09 → 17/03/09

Access to Document

10.1007/978-3-642-00457-5_6

Cite this

@inproceedings{9fdfe9e76abf4c02bd80d38b187fdc15,

title = "Non-malleable Obfuscation",

abstract = "Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.",

author = "Ran Canetti and Mayank Varia",

year = "2009",

doi = "10.1007/978-3-642-00457-5_6",

language = "אנגלית",

isbn = "3642004563",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "73--90",

booktitle = "Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings",

note = "6th Theory of Cryptography Conference, TCC 2009 ; Conference date: 15-03-2009 Through 17-03-2009",

}

Canetti, R & Varia, M 2009, Non-malleable Obfuscation. in Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5444 LNCS, pp. 73-90, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, United States, 15/03/09. https://doi.org/10.1007/978-3-642-00457-5_6

Non-malleable Obfuscation. / Canetti, Ran; Varia, Mayank.
Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings. 2009. p. 73-90 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5444 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Non-malleable Obfuscation

AU - Canetti, Ran

AU - Varia, Mayank

PY - 2009

Y1 - 2009

N2 - Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.

AB - Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of non-malleability requirements for program obfuscation, and show that they are incomparable in general. We also construct non-malleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also define the notion of verifiable obfuscation which is of independent interest.

UR - http://www.scopus.com/inward/record.url?scp=70350657206&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00457-5_6

DO - 10.1007/978-3-642-00457-5_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70350657206

SN - 3642004563

SN - 9783642004568

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 73

EP - 90

BT - Theory of Cryptography - 6th Theory of Cryptography Conference, TCC 2009, Proceedings

T2 - 6th Theory of Cryptography Conference, TCC 2009

Y2 - 15 March 2009 through 17 March 2009

ER -

Non-malleable Obfuscation

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this