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?

  • 3
    $\begingroup$ 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)? $\endgroup$
    – poncho
    Aug 14 '19 at 15:13
  • $\begingroup$ My question is about the interactive example $\endgroup$ Aug 14 '19 at 15:33
  • $\begingroup$ Perhaps via a form of functional encryption? Still just academic research $\endgroup$
    – Natanael
    Aug 14 '19 at 15:41
  • $\begingroup$ 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". $\endgroup$ Aug 14 '19 at 17:10
  • $\begingroup$ Ruben De Smet yes, it is a good idea. Any suggestions about how to do that? $\endgroup$ Aug 14 '19 at 17:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.