3

Let's say that Alice has this information about her,

{ "name": "Alice", "age": 25, "eyes": "brown" }

which she encrypts with a key pair so that no one access this text.

Later she says Bob that her eyes are brown and Bob should be able to verify only that she has brown eyes, with other information remaining secret.

This mechanism would be similar to merkle tree partial info verification, except we have here the encrypted file not the tree.

Is it possible to partially verify that?

Maxim Gaina
  • 31
  • 2
  • 3
    Are you looking for an interactive protocol (e.g. Alice gives a ZKP that the encrypted record says her eyes are brown), or noninteractive (e.g. Bob, given a guess about Alice's eye color, is able to deduce from the encrypted record whether that guess is correct)? – poncho Aug 14 '19 at 15:13
  • My question is about the interactive example – Maxim Gaina Aug 14 '19 at 15:33
  • Perhaps via a form of functional encryption? Still just academic research – Natanael Aug 14 '19 at 15:41
  • Would a zero-knowledge proof for the statement "I, Alice, know a key that decrypts said ciphertext to a JSON, and said JSON contains `eyes: "brown"`" suffice? Because for that, the answer to your question is "yes". – Ruben De Smet Aug 14 '19 at 17:10
  • Ruben De Smet yes, it is a good idea. Any suggestions about how to do that? – Maxim Gaina Aug 14 '19 at 17:42
  • Not very interesting maybe, but I don't know what you're doing with the quotation marks in the data about Alice. Sometimes strings get quotation marks, sometimes they don't? – Maarten Bodewes Aug 14 '19 at 21:39
  • :) just typos, I will edit – Maxim Gaina Aug 15 '19 at 08:46

0 Answers0