Results 1  10
of
296,318
MultiInput Functional Encryption in the PrivateKey Setting: Stronger Security from Weaker Assumptions
"... We construct a generalpurpose multiinput functional encryption scheme in the privatekey setting. Namely, we construct a scheme where a functional key corresponding to a function f enables a user holding encryptions of x1; : : : ; xt to compute f(x1; : : : ; xt) but nothing else. This is achieved ..."
Abstract
 Add to MetaCart
We construct a generalpurpose multiinput functional encryption scheme in the privatekey setting. Namely, we construct a scheme where a functional key corresponding to a function f enables a user holding encryptions of x1; : : : ; xt to compute f(x1; : : : ; xt) but nothing else. This is achieved
Multiinput functional encryption
"... We introduce the problem of MultiInput Functional Encryption, where a secret key SKf can correspond to an nary function f that takes multiple ciphertexts as input. Multiinput functional encryption is a general tool for computing on encrypting data which allows for mining aggregate information fro ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We introduce the problem of MultiInput Functional Encryption, where a secret key SKf can correspond to an nary function f that takes multiple ciphertexts as input. Multiinput functional encryption is a general tool for computing on encrypting data which allows for mining aggregate information
MultiInput Functional Encryption
"... Functional encryption (FE) is a powerful primitive enabling finegrained access to encrypted data. In an FE scheme, secret keys (“tokens”) correspond to functions; a user in possession of a ciphertext ct = Enc(x) and a token TKf for the function f can compute f(x) but learn nothing else about x. An ..."
Abstract
 Add to MetaCart
. An active area of research over the past few years has focused on the development of ever more expressive FE schemes. In this work we introduce the notion of multiinput functional encryption. Here, informally, a user in possession of a token TKf for an nary function f and multiple ciphertexts ct1 = Enc(x1
FunctionPrivate Functional Encryption in the PrivateKey Setting
"... Functional encryption supports restricted decryption keys that allow users to learn specic functions of the encrypted messages. Whereas the vast majority of research on functional encryption has so far focused on the privacy of the encrypted messages, in many realistic scenarios it is crucial to of ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
to offer privacy also for the functions for which decryption keys are provided. Whereas function privacy is inherently limited in the publickey setting, in the privatekey setting it has a tremendous potential. Specically, one can hope to construct schemes where encryptions of messages m1; : : :;m
Privatekey symbolic . . .
"... Symbolic encryption, in the style of DolevYao models, is ubiquitous in formal security analysis aiming at the automated verification of network protocols. The naïve use of symbolic encryption, however, may unnecessarily require an expensive construction: an arbitrarylength encryption scheme that i ..."
Abstract
 Add to MetaCart
that is private and nonmalleable in an adaptive CCACPA setting. Most of the time, such assumptions remain hidden and rather symbolic encryption is instantiated with a seemingly “good ” cryptographic encryption, such as AES in the CBC configuration. As an illustration of this problem, we first report new attacks
Characterization of Security Notions for Probabilistic PrivateKey Encryption
 JOURNAL OF CRYPTOLOGY
, 2006
"... The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of privatekey encryption. Extending security notions from the publickey setting, we ..."
Abstract

Cited by 67 (9 self)
 Add to MetaCart
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptography. Here, we focus on the case of privatekey encryption. Extending security notions from the publickey setting
Functional Encryption for Randomized Functionalities in the PrivateKey Setting from Minimal Assumptions
"... We present a construction of a privatekey functional encryption scheme for any family of randomized functionalities based on any such scheme for deterministic functionalities that is sufficiently expressive. Instantiating our construction with existing schemes for deterministic functionalities, we ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
, Koppula and Sahai [Cryptology ePrint Archive, 2013] constructed a publickey functional encryption scheme for any family of randomized functionalities based on indistinguishability obfuscation. One of the key insights underlying our work is that, in the privatekey setting, a sufficiently expressive
IdentityBased Encryption from the Weil Pairing
, 2001
"... We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic ..."
Abstract

Cited by 1699 (29 self)
 Add to MetaCart
We propose a fully functional identitybased encryption scheme (IBE). The scheme has chosen ciphertext security in the random oracle model assuming an elliptic curve variant of the computational DiffieHellman problem. Our system is based on bilinear maps between groups. The Weil pairing
Homomorphic encryption: From privatekey to publickey
 In Proceedings of the 8th Theory of Cryptography Conference, TCC ’11
, 2011
"... We show that any privatekey encryption scheme that is weakly homomorphic with respect to addition modulo 2, can be transformed into a publickey encryption scheme. The homomorphic feature referred to is a minimalistic one; that is, the length of a homomorphically generated encryption should be inde ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We show that any privatekey encryption scheme that is weakly homomorphic with respect to addition modulo 2, can be transformed into a publickey encryption scheme. The homomorphic feature referred to is a minimalistic one; that is, the length of a homomorphically generated encryption should
Data Security
, 1979
"... The rising abuse of computers and increasing threat to personal privacy through data banks have stimulated much interest m the techmcal safeguards for data. There are four kinds of safeguards, each related to but distract from the others. Access controls regulate which users may enter the system and ..."
Abstract

Cited by 611 (3 self)
 Add to MetaCart
and subsequently whmh data sets an active user may read or wrote. Flow controls regulate the dissemination of values among the data sets accessible to a user. Inference controls protect statistical databases by preventing questioners from deducing confidential information by posing carefully designed sequences
Results 1  10
of
296,318