Results 1  10
of
2,294
On Symmetric Encryption and Point Obfuscation
, 2010
"... We show tight connections between several cryptographic primitives, namely encryption with weakly random keys, encryption with keydependent messages (KDM), and obfuscation of point functions with multibit output (which we call multibit point functions, or MBPFs, for short). These primitives, whic ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We show tight connections between several cryptographic primitives, namely encryption with weakly random keys, encryption with keydependent messages (KDM), and obfuscation of point functions with multibit output (which we call multibit point functions, or MBPFs, for short). These primitives
Securely Obfuscating Reencryption
 Theory of Cryptography Conference TCC
, 2007
"... We present a positive obfuscation result for a traditional cryptographic functionality. This positive result stands in contrast to wellknown impossibility results [3] for general obfuscation and recent impossibility and improbability [13] results for obfuscation of many cryptographic functionalitie ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
functionalities. Whereas other positive obfuscation results in the standard model apply to very simple point functions, our obfuscation result applies to the significantly more complex and widelyused reencryption functionality. This functionality takes a ciphertext for message m encrypted under Alice’s public
SOFTWARE OBFUSCATION WITH SYMMETRIC CRYPTOGRAPHY
, 2008
"... The views expressed in this thesis are those of the author and do not reflect the official ..."
Abstract
 Add to MetaCart
The views expressed in this thesis are those of the author and do not reflect the official
Searchable symmetric encryption: improved definitions and efficient constructions
 Proceedings of the 13th ACM conference on Computer and communications security, CCS ’06, ACM
, 2006
"... Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have been ..."
Abstract

Cited by 171 (6 self)
 Add to MetaCart
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search over it. This problem has been the focus of active research and several security definitions and constructions have
Proactive Obfuscation
"... Proactive obfuscation is a new method for creating server replicas that are likely to have fewer shared vulnerabilities. It uses semanticspreserving code transformations to generate diverse executables, periodically restarting servers with these fresh versions. The periodic restarts help bound the ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
Proactive obfuscation is a new method for creating server replicas that are likely to have fewer shared vulnerabilities. It uses semanticspreserving code transformations to generate diverse executables, periodically restarting servers with these fresh versions. The periodic restarts help bound
Fully Secure Functional Encryption without Obfuscation
"... Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (basically, one per circuit), or a polynomial set of assumptions, but with an exponential loss in the security red ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
Previously known functional encryption (FE) schemes for general circuits relied on indistinguishability obfuscation, which in turn either relies on an exponential number of assumptions (basically, one per circuit), or a polynomial set of assumptions, but with an exponential loss in the security
obfuscating conjunctions
 of Lecture Notes in Computer Science
, 2013
"... We show how to securely obfuscate the class of conjunction functions (functions like f(x1,..., xn) = x1 ∧ ¬x4 ∧ ¬x6 ∧ · · · ∧ xn−2). Given any function in the class, we produce an obfuscated program which preserves the inputoutput functionality of the given function, but reveals nothing else. ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
We show how to securely obfuscate the class of conjunction functions (functions like f(x1,..., xn) = x1 ∧ ¬x4 ∧ ¬x6 ∧ · · · ∧ xn−2). Given any function in the class, we produce an obfuscated program which preserves the inputoutput functionality of the given function, but reveals nothing else
On strong simulation and composable point obfuscation
 CRYPTO 2010, volume 6223 of LNCS
, 2010
"... 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 o ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
), in the context of composable obfuscators for point programs: it is known that, with respect to VBB, if such obfuscators exist, then there exist multibit point obfuscators (also known as “digital lockers”) and subsequently also very strong variants of encryption that are resilient to various attacks, such as key
Patchable Obfuscation
, 2015
"... In this work, we introduce patchable obfuscation: our notion adapts the notion of indistinguishability obfuscation (iO) to a very general setting where obfuscated software evolves over time. We model this broadly by considering software patches P as arbitrary Turing Machines that take as input the d ..."
Abstract
 Add to MetaCart
In this work, we introduce patchable obfuscation: our notion adapts the notion of indistinguishability obfuscation (iO) to a very general setting where obfuscated software evolves over time. We model this broadly by considering software patches P as arbitrary Turing Machines that take as input
Functional reencryption and collusionresistant obfuscation, in
 9th Theory of Cryptography Conference (TCC), volume 7194 of Lecture Notes in Computer Science
, 2012
"... We introduce a natural cryptographic functionality called functional reencryption. Informally, this functionality, for a publickey encryption scheme and a function F with n possible outputs, transforms (“reencrypts”) an encryption of a message m under an “input public key” pk into an encryption o ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
construction of a functional reencryption scheme for any function F with a polynomialsize domain and show that it satisfies this notion of collusionresistant obfuscation. We note that collusionresistant security can be viewed as a special case of dependent auxiliary input security (a setting where
Results 1  10
of
2,294