Program Obfuscation and One-Time Programs

DOI10.1007/978-3-540-79263-5_21zbMATH Open1153.68372OpenAlexW2116321697MaRDI QIDQ5458949FDOQ5458949

Authors: Shafi Goldwasser 

Publication date: 24 April 2008

Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_21

Recommendations

• One-Time Programs
• On the (im)possibility of obfuscating programs
• Advances in Cryptology - EUROCRYPT 2004
• scientific article; zbMATH DE number 1842483
• One-time programs with limited memory

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (12)

• Can a program reverse-engineer itself?
• Program obfuscation with leaky hardware
• Incremental program obfuscation
• One-time programs from commodity hardware
• On best-possible obfuscation
• Hiding Circuit Topology from Unbounded Reverse Engineers
• On obfuscating programs with tamper-proof hardware
• A general and efficient obfuscation for programs with tamper-proof hardware
• COA-secure obfuscation and applications
• One-time programs with limited memory
• One-Time Programs
• On the (im)possibility of obfuscating programs

Uses Software

• JavaScript

This page was built for publication: Program Obfuscation and One-Time Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458949)