NDLI: On Strong Simulation and Composable Point Obfuscation

Content Provider	Springer Nature Link
Author	Bitansky, Nir Canetti, Ran
Copyright Year	2013
Abstract	The Virtual Black Box (VBB) property for program obfuscators provides a strong guarantee: anything computable by an efficient adversary, given the obfuscated program, can also be computed by an efficient simulator, with only oracle access to the program. However, we know how to achieve this notion only for very restricted classes of programs.This work studies a simple relaxation of VBB: allow the simulator unbounded computation time, while still allowing only polynomially many queries to the oracle. We demonstrate the viability of this relaxed notion, which we call Virtual Grey Box (VGB), in the context of composable obfuscators for point programs: it is known that, with respect to VBB, if such obfuscators exist, then there exist multi-bit point obfuscators (also known as “digital lockers”) and subsequently also very strong variants of encryption that are resilient to various attacks, such as key leakage and key-dependent-messages. However, no composable VBB-obfuscators for point programs have been shown. We show composable VGB-obfuscators for point programs under a strong variant of the Decision Diffie–Hellman assumption. We show that VGB (instead of VBB) obfuscation still suffices for the above applications, as well as for new applications. This includes extensions to the public key setting and to encryption schemes with resistance to certain related key attacks (RKA).
Starting Page	317
Ending Page	357
Page Count	41
File Format	PDF
ISSN	09332790
Journal	Journal of Cryptology
Volume Number	27
Issue Number	2
e-ISSN	14321378
Language	English
Publisher	Springer US
Publisher Date	2013-02-16
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Obfuscation Strong simulation Composable point obfuscation Strong encryption Decision Diffie–Hellman Coding and Information Theory Computational Mathematics and Numerical Analysis Combinatorics Probability Theory and Stochastic Processes Communications Engineering, Networks
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Batch Diffie-Hellman key agreement systems

An Algebraic Framework for Diffie–Hellman Assumptions

The Twin Diffie–Hellman Problem and Applications

Securely Obfuscating Re-Encryption

Obfuscation for Cryptographic Purposes

A Fast Diffie—Hellman Protocol in Genus 2

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems

On Best-Possible Obfuscation

Secret-Sharing for NP

On Strong Simulation and Composable Point Obfuscation

Similar Documents

Batch Diffie-Hellman key agreement systems

An Algebraic Framework for Diffie–Hellman Assumptions

The Twin Diffie–Hellman Problem and Applications

Securely Obfuscating Re-Encryption

Obfuscation for Cryptographic Purposes

A Fast Diffie—Hellman Protocol in Genus 2

Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems

On Best-Possible Obfuscation

Secret-Sharing for NP

On Strong Simulation and Composable Point Obfuscation