Attribute-based optimistic fair exchange: how to restrict brokers with policies
From MaRDI portal
Publication:2437777
DOI10.1016/J.TCS.2014.01.029zbMath1282.68099OpenAlexW2003873056MaRDI QIDQ2437777
Man Ho Au, Willy Susilo, Yang Wang
Publication date: 13 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.029
Related Items (2)
Ambiguous optimistic fair exchange: definition and constructions ⋮ How to protect privacy in optimistic fair exchange of digital signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Group-oriented fair exchange of signatures
- Certificate-based verifiably encrypted signatures from pairings
- Standards and verification for fair-exchange and atomicity in e-commerce transactions
- The construction of ambiguous optimistic fair exchange from designated confirmer signature without random oracles
- New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
- Ciphertext-Policy Attribute-Based Encryption: An Expressive, Efficient, and Provably Secure Realization
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Ambiguous Optimistic Fair Exchange
- Optimistic fair exchange of digital signatures
- Efficient Identity-Based Encryption Without Random Oracles
- Fuzzy Identity-Based Encryption
- Efficient Optimistic Fair Exchange Secure in the Multi-user Setting and Chosen-Key Model without Random Oracles
- Optimistic Fair Exchange in a Multi-user Setting
- Efficient Ring Signatures Without Random Oracles
- Topics in Cryptology – CT-RSA 2006
This page was built for publication: Attribute-based optimistic fair exchange: how to restrict brokers with policies