Cryptography Stack Exchange
Cryptography Stack Exchange

Questions tagged [predicate-encryption]

Predicate encryption is an encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data.

Predicate encryption is an encryption paradigm which gives a master secret key owner fine-grained control over access to encrypted data.

The master secret key owner can generate secret key tokens corresponding to predicates. An encryption of data $x$ can be evaluated using a secret token corresponding to a predicate $f$; the user learns whether the data satisfies the predicate, i.e., whether $f(x) = 1$.

10 questions
9
votes
4 answers

Is there any semantic difference between predicate encryption and functional encryption?

Predicate encryption(PE) arrived as a descendant of attribute based encryption. Attribute based encryption allows the encryptor to embody a policy to the ciphertext (Ciphertext-Policy based encryption) and the receipent to receive a key from a…
curious
  • 6,280
  • 6
  • 34
  • 48
4
votes
0 answers

Predicate Encryption supporting disjunctions

I am not sure if I missed some subtlety in the definition of Attribute Hiding found in this paper on Predicate Encryption, but isn't it possible to construct a scheme for Predicate Encryption supporting disjunctions that is both a lot less…
Henrick Hellström
  • 10,556
  • 1
  • 32
  • 59
4
votes
0 answers

Functional encryption for inner products from DDH

I have been reading this paper by Abdalla, et al. But there's something I don't get about the security proof (Theorem 3.2) for the basic IP scheme from DDH--how are they simulating the mpk's using $g^a$? I understand that for each basis vector they…
Cinderella
  • 307
  • 2
  • 8
3
votes
1 answer

How are Predicate Encryption algorithms implemented?

After a lot of reading on the internet, i can't seem to figure out how Predicate Encryption works. As i read, it consists of 4 algorithms: Setup() - (outputs MSK - Master Secret Key and PK - Public Key) Encrypt(PK, text) - (outputs CT -…
Cristi Pufu
  • 133
  • 5
2
votes
1 answer

What is the main difference between Anonymous HIBE and Anonymous Predicate Encryption?

What is the main difference between Anonymous HIBE and Anonymous Predicate Encryption? In my opinion, both work for the same concept in different ways.
Kashif Inayat
  • 21
  • 2
2
votes
1 answer

How to encode bivariate polynomial in Predicate Encryption and Inner Product?

From the paper Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products, the vector of the secret key is generated from a polynomial $p(x)$. I understand the univariate polynomial, but what does the vector of a…
Tri Vo Hoang
  • 35
  • 1
  • 4
2
votes
1 answer

Which one is more general, attribute based encryption or inner product predicate encryption?

If we have a scheme for inner product predicate encryption (IPPE), then can we claim that we already have designed an attribute based encryption (ABE) scheme; So we do not need to design an ABE again. I mean, is IPPE more general than ABE? What…
user1035648
  • 673
  • 5
  • 14
1
vote
0 answers

Negligible probability of failure in correctness definition (predicate based encryption)

I would like to understand why some definitions of correctness allow a negligible failure probability. i.e. the probability that decryption reverses encryption is 1 minus a negligibly small amount. I have noticed in the Katz, Sahai, Waters Predicate…
George
  • 11
  • 1
0
votes
3 answers

How to encrypt a message such when a certain condition is met it can be decrypted?

Assume, there is a certificate authority whose public key: $pk$, is known. Also, the certificate $c$ is known, but not the signed certificate. I want to encrypt a message: $m$, such that whoever has a signed certificate can decrypt the message. Note…
Aydin
  • 452
  • 2
  • 11
0
votes
1 answer

About numberical comparison in Attribute based encryption

The first CP-ABE scheme in [BSW07] gave an example how to present a numberical comparison (e.g., a<11) to a Boolean access tree. But it seems like this feature is not implemented in Charm. In the paper, the access policy a<11 is presented…
Tri Vo Hoang
  • 35
  • 1
  • 4