• state and progress in strand spaces: proving fair exchange

    نویسندگان :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 809
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     many cryptographic protocols are intended to coordinate state changes among principals. exchange protocols, for instance, coordinate delivery of new values to the participants, i.e. additions to the set of values they possess. an exchange protocol is fair if it ensures that delivery of new values is balanced: if one participant obtains a new possession via the protocol, then all other participants will, too. understanding this balanced coordination of different principals in a distributed system requires relating (long-term) state to (short-term) protocol activities. fair exchange also requires progressassumptions. in this paper we adapt the strand space framework to protocols, such as fair exchange, that coordinate state changes. we regard the state as a multiset of facts, and we allow protocol actions to cause local changes in this state via multiset rewriting. second, progressassumptions stipulate that some channels are resilient—and guaranteed to deliver messages—and some principals will not stop at critical steps. our proofs of correctness cleanly separate protocol properties, such as authentication and confidentiality, from properties about progress and state evolution. g. wang’s recent fair exchange protocol illustrates the approach.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها