A new efficient optimistic fair exchange protocol without random oracles
Optimistic fair exchange (OFE) is a kind of protocols to solve the problem of fair exchange between two parties. Most of the previous work on this topic are provably secure in the random oracle model. In this work, we propose a new construction of OFE from another cryptographic primitive, called tim...
Saved in:
Main Authors: | HUANG, Qiong, YANG, Guomin, WONG, Duncan S., SUSILO, Willy |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/7351 https://ink.library.smu.edu.sg/context/sis_research/article/8354/viewcontent/s10207_011_0152_3.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
A new efficient optimistic fair exchange protocol without random oracles
by: Huang, Q., et al.
Published: (2014) -
Ambiguous optimistic fair exchange: Definition and constructions
by: HUANG, Qiong, et al.
Published: (2015) -
Provably secure robust optimistic fair exchange of distributed signatures
by: WANG, Yujue, et al.
Published: (2016) -
Efficient optimistic fair exchange secure in the multi-user setting and chosen-key model without random oracles
by: HUANG, Qiong, et al.
Published: (2008) -
Efficient strong designated verifier signature schemes without random oracle or with non-delegatability
by: HUANG, Qiong, et al.
Published: (2011)