Incentive-driven attacker for corrupting two-party protocols

DOI10.1007/S00500-018-3342-3zbMath1402.94072OpenAlexW2809435741WikidataQ129621324 ScholiaQ129621324MaRDI QIDQ1626274

Huiyu Zhou, Roberto Metere, Tao Li, Yilei Wang, Guang-Hai Cui

Publication date: 27 November 2018

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-018-3342-3

zbMATH Keywords

two-party computationcost corruptionincentive-driven adversary

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Partial fairness in secure two-party computation
• Secure deduplication storage systems supporting keyword search
• Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
• Differentially private naive Bayes learning over multiple data sources
• Public audit for operation behavior logs with error locating in cloud storage
• Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
• How to Use Bitcoin to Design Fair Protocols
• Fair Computation with Rational Players
• Verifiable Computation over Large Database with Incremental Updates
• Towards a Game Theoretic View of Secure Computation
• Rational secret sharing and multiparty computation
• An Optimally Fair Coin Toss
• Foundations of Cryptography
• Modeling Bitcoin Contracts by Timed Automata

This page was built for publication: Incentive-driven attacker for corrupting two-party protocols