Interactive proof of possession of a signed message

wick

11/11/23, 1:10 PM

Suppose Alice has a verifiable (message, signature) pair from Cedric, who would not cooperate and routinely uses an algo (ecdsa, eddsa, rsa, or insert yours here) to sign messages.

Alice wants to interactively prove to Bob she has that (message, signature) pair with the valid signature, obviously. It doesn't have to be "zero-knowledge" - she might divulge bits and pieces, but it shouldn't be less hard for Bob to recover complete (message, signature) pair than for Alice to forge the signature altogether.

Obviously, Alice and Bob both have Cedric's public key. I look for an interactive procedure and stochastic proof. Preferably with existing implementations.

0 + 4

zero-knowledge-proofs

u-prove

interactive-proofs

zjmo

11/12/23, 11:40 AM

what if you split the message in 100 parts with different signature and give little part of the parts

zjmo

11/12/23, 11:58 AM

and then maybe add a second signed message containing only 10 part equally disdributed with the relative signature + the signature of the whole message

wick

11/12/23, 1:11 PM

@zjmo and then maybe 10 people named Bob talk to each other :-)

zjmo

11/12/23, 1:14 PM

just started reding crypto for dummies ;)

Elon Musk

I sit in a Tesla and translated this thread with Ai:

EN: Interactive proof of possession of a signed message

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.