Results 1  10
of
4,604
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
The Hero with a Thousand Faces
, 1972
"... Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second ..."
Abstract

Cited by 353 (0 self)
 Add to MetaCart
Botiingen Foundation, andpttt.!.,.: b % / ,.,;:,c,m B<,.ik.*, second
Candidate indistinguishability obfuscation and functional encryption for all circuits
 In FOCS
, 2013
"... In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C0 and C1 of similar size, the obfuscations of C0 and C1 should be computationally indistinguishable. In functional ..."
Abstract

Cited by 169 (37 self)
 Add to MetaCart
In this work, we study indistinguishability obfuscation and functional encryption for general circuits: Indistinguishability obfuscation requires that given any two equivalent circuits C0 and C1 of similar size, the obfuscations of C0 and C1 should be computationally indistinguishable
Predicate encryption for circuits from LWE
, 2015
"... In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext µ, and a secret key is associated with a predicate f. Decryption returns plaintext µ if and only if f(x) = 1. Moreover, security of predicate encryption guarantees that an adversary le ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(LWE) problem. That is, for any polynomial function d = d(λ), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(λ), where λ is the security parameter.
3D Sound for Virtual Reality and Multimedia
, 2000
"... This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound ..."
Abstract

Cited by 282 (5 self)
 Add to MetaCart
This paper gives HRTF magnitude data in numerical form for 43 frequencies between 0.212 kHz, the average of 12 studies representing 100 different subjects. However, no phase data is included in the tables; group delay simulation would need to be included in order to account for ITD. In 3D sound applications intended for many users, we want might want to use HRTFs that represent the common features of a number of individuals. But another approach might be to use the features of a person who has desirable HRTFs, based on some criteria. (One can sense a future 3D sound system where the pinnae of various famous musicians are simulated.) A set of HRTFs from a good localizer (discussed in Chapter 2) could be used if the criterion were localization performance. If the localization ability of the person is relatively accurate or more accurate than average, it might be reasonable to use these HRTF measurements for other individuals. The Convolvotron 3D audio system (Wenzel, Wightman, and Foster, 1988) has used such sets particularly because elevation accuracy is affected negatively when listening through a bad localizers ears (see Wenzel, et al., 1988). It is best when any single nonindividualized HRTF set is psychoacoustically validated using a 113 statistical sample of the intended user population, as shown in Chapter 2. Otherwise, the use of one HRTF set over another is a purely subjective judgment based on criteria other than localization performance. The technique used by Wightman and Kistler (1989a) exemplifies a laboratorybased HRTF measurement procedure where accuracy and replicability of results were deemed crucial. A comparison of their techniques with those described in Blauert (1983), Shaw (1974), Mehrgardt and Mellert (1977), Middlebrooks, Makous, and Gree...
Packed Ciphertexts in LWEbased Homomorphic Encryption
, 2012
"... In this short note we observe that the PeikertVaikuntanathanWaters (PVW) method of packing many plaintext elements in a single Regevtype ciphertext, can be used for performing SIMD homomorphic operations on packed ciphertext. This provides an alternative to the SmartVercauteren (SV) ciphertextpa ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
) ciphertextpacking technique that relies on polynomialCRT. While the SV technique is only applicable to schemes that rely on ringLWE (or other hardness assumptions in ideal lattices), the PVW method can be used also for cryptosystems whose security is based on standard LWE (or more broadly on the hardness
Obfuscated databases and group privacy
 In Proc. 12th ACM Conference on Computer and Communications Security
, 2005
"... ABSTRACT We investigate whether it is possible to encrypt a database and then give it away in such a form that users can still access it, but only in a restricted way. In contrast to conventional privacy mechanisms that aim to prevent any access to individual records, we aim to restrict the set of q ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
of queries that can be feasibly evaluated on the encrypted database. We start with a simple form of database obfuscation which makes database records indistinguishable from lookup functions. The only feasible operation on an obfuscated record is to look up some attribute Y by supplying the value of another
Indistinguishability Obfuscation: from Approximate to Exact∗
"... We show general transformations from subexponentiallysecure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 + fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where the obfu ..."
Abstract
 Add to MetaCart
We show general transformations from subexponentiallysecure approximate indistinguishability obfuscation (IO) where the obfuscated circuit agrees with the original circuit on a 1/2 + fraction of inputs on a certain samplable distribution, into exact indistinguishability obfuscation where
Hardness of kLWE and Applications in Traitor Tracing
"... Abstract. We introduce the kLWE problem, a Learning With Errors variant of the kSIS problem. The BonehFreeman reduction from SIS to kSIS suffers from an exponential loss in k. We improve and extend it to an LWE to kLWE reduction with a polynomial loss in k, by relying on a new technique involv ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. We introduce the kLWE problem, a Learning With Errors variant of the kSIS problem. The BonehFreeman reduction from SIS to kSIS suffers from an exponential loss in k. We improve and extend it to an LWE to kLWE reduction with a polynomial loss in k, by relying on a new technique
Results 1  10
of
4,604