Results 1  10
of
478
OutsiderAnonymous Broadcast Encryption with Sublinear Ciphertexts
"... Abstract. In the standard setting of broadcast encryption, information about the receivers is transmitted as part of the ciphertext. In several broadcast scenarios, however, the identities of the users authorized to access the content are often as sensitive as the content itself. In this paper, we p ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
propose the first broadcast encryption scheme with sublinear ciphertexts to attain meaningful guarantees of receiver anonymity. We formalize the notion of outsideranonymous broadcast encryption (oABE), and describe generic constructions in the standard model that achieve outsideranonymity under adaptive
A publickey blackbox traitor tracing scheme with sublinear ciphertext size against selfdefensive pirates
 In Proc. of Advances in Cryptology – Asiacrypt’04
, 2004
"... Abstract. We propose a publickey traitor tracing scheme in which (1) the size of a ciphertext is sublinear in the number of receivers and (2) blackbox tracing is efficiently achieved against selfdefensive pirate decoders. When assuming that a pirate decoder can take some selfdefensive reaction ( ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. We propose a publickey traitor tracing scheme in which (1) the size of a ciphertext is sublinear in the number of receivers and (2) blackbox tracing is efficiently achieved against selfdefensive pirate decoders. When assuming that a pirate decoder can take some selfdefensive reaction
Evaluating 2dnf formulas on ciphertexts
 In proceedings of TCC ’05, LNCS series
, 2005
"... Abstract. Let ψ be a 2DNF formula on boolean variables x1,..., xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create th ..."
Abstract

Cited by 230 (7 self)
 Add to MetaCart
the encryption of ψ(x1,..., xn). More generally, we can evaluate quadratic multivariate polynomials on ciphertexts provided the resulting value falls within a small set. We present a number of applications of the system: 1. In a database of size n, the total communication in the basic step of the Kushilevitz
Fully collusion resistant traitor tracing with short ciphertexts and private keys
 In EUROCRYPT
, 2006
"... We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let N be the total number of users. Our system generates ciphertexts of size O ( √ N) and private keys of size O(1). We first introduce a simpler primitiv ..."
Abstract

Cited by 66 (12 self)
 Add to MetaCart
We construct a fully collusion resistant tracing traitors system with sublinear size ciphertexts and constant size private keys. More precisely, let N be the total number of users. Our system generates ciphertexts of size O ( √ N) and private keys of size O(1). We first introduce a simpler
Secure function collection with sublinear storage
 In ICALP (2
, 2009
"... Abstract. Consider a center possessing a trusted (tamper proof) device that wishes to securely compute a public function over private inputs that are contributed by some network nodes. In network scenarios that support direct communication of nodes with the center, the computation can be done by th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
collection requires the agent to store a linear number of ciphertexts. The goal of this work is to formalize and solve the above problem for a general set of functions by an agent that employs sublinear storage while maintaining input privacy (an important technical requirement akin
Evaluating 2DNF Formulas on Ciphertexts
"... Abstract. Let be a 2DNF formula on boolean variables x1,..., xn 2{ 0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of given an encryption of the variables x1,..., xn. In other words, given the encryption of the bits x1,..., xn, anyone can create the en ..."
Abstract
 Add to MetaCart
the encryption of (x1,..., xn). More generally, we can evaluate quadratic multivariate polynomials on ciphertexts provided the resulting value falls within a small set. We present a number of applications of the system: 1. In a database of size n, the total communication in the basic step of the Kushilevitz
Secure Computation with Sublinear Amortized Work
"... Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computa ..."
Abstract
 Add to MetaCart
computation of nontrivial functions, since each party must “touch ” every bit of their input lest information about other party’s input be leaked. This seems to rule out many interesting applications of secure computation in scenarios where at least one of the inputs is huge and sublineartime algorithms can
Sublinear zeroknowledge argument for correctness of a shuffle
 Proceedings of EUROCRYPT 2008, LNCS 4965
, 2008
"... A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mixnets, which in turn are used in protocols for anonymization and voting. Since the plaintexts are encrypted it is not directly verif ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mixnets, which in turn are used in protocols for anonymization and voting. Since the plaintexts are encrypted it is not directly
Results 1  10
of
478