Results 1  10
of
354
Fully homomorphic encryption with relatively small key and ciphertext sizes
 In Public Key Cryptography — PKC ’10, Springer LNCS 6056
, 2010
"... Abstract. We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat ” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys c ..."
Abstract

Cited by 116 (9 self)
 Add to MetaCart
Abstract. We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction follows that of Gentry by producing a fully homomorphic scheme from a “somewhat ” homomorphic scheme. For the somewhat homomorphic scheme the public and private keys
Reducing the Ciphertext Size of DolevDworkNaor like Public Key cryptosystems
"... We show a method for compressing the ciphertext and reducing the computational cost of the DolevDworkNaor cryptosystem and related schemes without changing their other parameters nor reducing the original security levels. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show a method for compressing the ciphertext and reducing the computational cost of the DolevDworkNaor cryptosystem and related schemes without changing their other parameters nor reducing the original security levels.
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 231 (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
Collusion resistant broadcast encryption with short ciphertexts and private keys
"... We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both ciphertexts and private keys are of constant size (only two group elements), for any subset of receivers. The public ke ..."
Abstract

Cited by 197 (19 self)
 Add to MetaCart
We describe two new public key broadcast encryption systems for stateless receivers. Both systems are fully secure against any number of colluders. In our first construction both ciphertexts and private keys are of constant size (only two group elements), for any subset of receivers. The public
Traitor Tracing with Constant Size Ciphertext
, 2008
"... A traitor tracing system enables a publisher to trace a pirate decryption box to one of the secret keys used to create the box. We present the first traitor tracing system where ciphertext size is “constant, ” namely independent of the number of users in the system and the collusion bound. A ciphert ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
A traitor tracing system enables a publisher to trace a pirate decryption box to one of the secret keys used to create the box. We present the first traitor tracing system where ciphertext size is “constant, ” namely independent of the number of users in the system and the collusion bound. A
The RC5 Encryption Algorithm
, 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelengt ..."
Abstract

Cited by 363 (7 self)
 Add to MetaCart
word (64bit) input (plaintext) and output (ciphertext) block sizes. RC5 uses an \expanded key table, " S, derived from the user's supplied secret key. The size t of table S depends on the number r of rounds: S has t =2(r +1) words. There are thus several distinct \RC5 " algorithms
AttributeBased Encryption Schemes with ConstantSize Ciphertexts
 in "Theoretical Computer Science
"... Abstract. Attributebased encryption (ABE), as introduced by Sahai and Waters, allows for finegrained access control on encrypted data. In its keypolicy flavor (the dual ciphertextpolicy scenario proceeds the other way around), the primitive enables senders to encrypt messages under a set of attri ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
of attributes and private keys are associated with access structures that specify which ciphertexts the key holder will be allowed to decrypt. In most ABE systems, the ciphertext size grows linearly with the number of ciphertext attributes and the only known exception only supports restricted forms of access
Verifiable shuffle of large size ciphertexts
 In proceedings of Practice and Theory in Public Key Cryptography  PKC ’07, LNCS 4450
, 2007
"... Abstract. A shuffle is a permutation and rerandomization of a set of ciphertexts. Among other things, it can be used to construct mixnets that are used in anonymization protocols and voting schemes. While shuffling is easy, it is hard for an outsider to verify that a shuffle has been performed corr ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
Abstract. A shuffle is a permutation and rerandomization of a set of ciphertexts. Among other things, it can be used to construct mixnets that are used in anonymization protocols and voting schemes. While shuffling is easy, it is hard for an outsider to verify that a shuffle has been performed
Results 1  10
of
354