how to demonstrate that a protocol is certain with those specifications.

Posted by kawtousse on Stack Overflow See other posts from Stack Overflow or by kawtousse
Published on 2010-06-13T10:41:00Z Indexed on 2010/06/13 13:12 UTC
Read the original article Hit count: 291

Filed under:
|

Hi every one,

we have 4 persons A, B, C and D witch want to know the averge of their salary SA SB SC SD but no one wants that the others know his salary. For that they use this protocol:

  1. A->B: [N+SA ]KB
  2. B->C:[N+SA+SB]KC
  3. C->D:[N+SA+SB+SC]KD
  4. D->A:[N+SA+SB+SC+SD]KA

where the notation [m]KY represents the message x crypted xith the public key of y

Is this protocol certain. can we trust it. want you please give me justification.

thanks for help.

© Stack Overflow or respective owner

Related posts about homework

Related posts about protocols