nekomata_saren@tg says to YSITD
所以,你的問題 X is a protocol where the message X(A, B) necessarily and sufficiently proves to B that sender has A's RSA key pair. If Bob claims to have Alice's RSA key pair. Bob has sent X(Alice, e) for e in everyone. Does it prove that Bob have Alice's RSA key pair?