Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures

DOI10.1007/978-3-319-28166-7_10zbMath1338.94094OpenAlexW2294762643MaRDI QIDQ2794502

Jae Hong Seo, Keita Xagawa, Keita Emura, Kazuki Yoneyama

Publication date: 10 March 2016

Published in: Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28166-7_10

zbMATH Keywords

optimistic fair exchangehomomorphic signaturesverifiably encrypted signatures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Blockchain-based two-party fair contract signing scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient Network Coding Signatures in the Standard Model
• Improved Security for Linearly Homomorphic Signatures: A Generic Framework
• History-Free Sequential Aggregate Signatures
• Homomorphic Signatures for Polynomial Functions
• Adaptive Pseudo-free Groups and Applications
• The random oracle methodology, revisited
• Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
• Homomorphic Network Coding Signatures in the Standard Model
• Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
• Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
• New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
• Further Observations on Optimistic Fair Exchange Protocols in the Multi-user Setting
• Secure Network Coding over the Integers
• Preventing Pollution Attacks in Multi-source Network Coding
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• Ambiguous Optimistic Fair Exchange
• Signing a Linear Subspace: Signature Schemes for Network Coding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Optimistic fair exchange of digital signatures
• Dual Form Signatures: An Approach for Proving Security from Static Assumptions
• Computing on Authenticated Data: New Privacy Definitions and Constructions
• Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures
• Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES
• Sequential Aggregate Signatures with Short Public Keys: Design, Analysis and Implementation Studies
• Usable Optimistic Fair Exchange
• Efficient Identity-Based Encryption Without Random Oracles
• Rethinking Verifiably Encrypted Signatures: A Gap in Functionality and Potential Solutions
• Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
• Unrestricted Aggregate Signatures
• Optimistic Fair Exchange in a Multi-user Setting
• Topics in Cryptology – CT-RSA 2006

This page was built for publication: Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures