{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:15Z","timestamp":1740107835863,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T00:00:00Z","timestamp":1529625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502218"],"award-info":[{"award-number":["61502218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s00500-018-3342-3","type":"journal-article","created":{"date-parts":[[2018,6,22]],"date-time":"2018-06-22T09:53:49Z","timestamp":1529661229000},"page":"7733-7740","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incentive-driven attacker for corrupting two-party protocols"],"prefix":"10.1007","volume":"22","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Metere","sequence":"additional","affiliation":[]},{"given":"Huiyu","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Guanghai","family":"Cui","sequence":"additional","affiliation":[]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,22]]},"reference":[{"issue":"3","key":"3342_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.techsoc.2010.07.001","volume":"32","author":"S Abraham","year":"2010","unstructured":"Abraham S, Chengalur-Smith IS (2010) An overview of social engineering malware: trends, tactics, and implications. Technol Soc 32(3):183\u2013196","journal-title":"Technol Soc"},{"key":"3342_CR2","doi-asserted-by":"publisher","unstructured":"Adat V, Dahiya A, Gupta BB (2018) Economic incentive based solution against distributed denial of service attacks for IoT customers. In: IEEE international conference on consumer electronics, ICCE 2018, Las Vegas, NV, USA, January 12\u201314, 2018, pp 1\u20135. https:\/\/doi.org\/10.1109\/ICCE.2018.8326280","DOI":"10.1109\/ICCE.2018.8326280"},{"key":"3342_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-662-44774-1_8","volume-title":"Financial Cryptography and Data Security","author":"Marcin Andrychowicz","year":"2014","unstructured":"Andrychowicz M, Dziembowski S, Malinowski D, Mazurek \u0141 (2014) Fair two-party computations via bitcoin deposits. In: International conference on financial cryptography and data security. Springer, Berlin, pp 105\u2013121"},{"key":"3342_CR4","first-page":"426","volume":"6632","author":"G Asharov","year":"2011","unstructured":"Asharov G, Canetti R, Hazay C (2011) Towards a game theoretic view of secure computation. EUROCRYPT 6632:426\u2013445","journal-title":"EUROCRYPT"},{"key":"3342_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Iddo Bentov","year":"2014","unstructured":"Bentov I, Kumaresan R (2014) How to use bitcoin to design fair protocols. In: International cryptology conference. Springer, Berlin, pp 421\u2013439"},{"key":"3342_CR6","volume-title":"Message authentication codes","author":"JR Black","year":"2000","unstructured":"Black JR (2000) Message authentication codes. University of California, Davis"},{"issue":"10","key":"3342_CR7","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1109\/TC.2015.2512870","volume":"65","author":"X Chen","year":"2016","unstructured":"Chen X, Li J, Weng J, Ma J, Lou W (2016) Verifiable computation over large database with incremental updates. IEEE Trans Comput 65(10):3184\u20133195","journal-title":"IEEE Trans Comput"},{"key":"3342_CR8","first-page":"127","volume-title":"Lecture Notes in Computer Science","author":"David Derler","year":"2015","unstructured":"Derler D, Hanser C, Slamanig D (2015) Revisiting cryptographic accumulators, additional properties and relations to other primitives. In: Cryptographers $$\\circ \\emptyset $$ \u2218 \u2205 track at the RSA conference. Springer, San Francisco, pp 127\u2013144"},{"issue":"8","key":"3342_CR9","doi-asserted-by":"publisher","first-page":"7599","DOI":"10.1109\/TVT.2017.2669240","volume":"66","author":"L Fan","year":"2017","unstructured":"Fan L, Lei X, Yang N, Duong TQ, Karagiannidis GK (2017) Secrecy cooperative networks with outdated relay selection over correlated fading channels. IEEE Trans Veh Technol 66(8):7599\u20137603","journal-title":"IEEE Trans Veh Technol"},{"key":"3342_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.ins.2018.02.058","volume":"444","author":"C Gao","year":"2018","unstructured":"Gao C, Cheng Q, He P, Susilo W, Li J (2018) Privacy-preserving Naive Bayes classifiers secure against the substitution-then-comparison attack. Inf Sci 444:72\u201388","journal-title":"Inf Sci"},{"key":"3342_CR11","doi-asserted-by":"crossref","unstructured":"Garay J, Katz J, Maurer U, Tackmann B, Zikas V (2013) Rational protocol design: cryptography against incentive-driven adversaries. In: 2013 IEEE 54th annual symposium on foundations of computer science (FOCS). IEEE, pp 648\u2013657","DOI":"10.1109\/FOCS.2013.75"},{"key":"3342_CR12","volume-title":"Foundations of cryptography: volume 2, basic applications","author":"O Goldreich","year":"2009","unstructured":"Goldreich O (2009) Foundations of cryptography: volume 2, basic applications. Cambridge University Press, Cambridge"},{"issue":"1","key":"3342_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"SD Gordon","year":"2012","unstructured":"Gordon SD, Katz J (2012) Partial fairness in secure two-party computation. J Cryptol 25(1):14\u201340","journal-title":"J Cryptol"},{"key":"3342_CR14","doi-asserted-by":"crossref","unstructured":"Gordon SD, Hazay C, Lindell Y, Katz J (2008) Complete fairness in secure two-party computation. In 40th annual ACM symposium on theory of computing (STOC). Citeseer","DOI":"10.1145\/1374376.1374436"},{"key":"3342_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-29011-4_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Adam Groce","year":"2012","unstructured":"Groce A, Katz J (2012) Fair computation with rational players. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, Berlin, pp 81\u201398"},{"key":"3342_CR16","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-0105-3","volume-title":"Handbook of research on modern cryptographic solutions for computer and cyber security","author":"BB Gupta","year":"2016","unstructured":"Gupta BB, Agrawal DP, Yamaguchi S (2016) Handbook of research on modern cryptographic solutions for computer and cyber security. IGI Global, Hershey"},{"key":"3342_CR17","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jnca.2015.09.004","volume":"58","author":"FL Haddi","year":"2015","unstructured":"Haddi FL, Bencha\u00efba M (2015) A survey of incentive mechanisms in static and mobile p2p systems. J Netw Comput Appl 58:108\u2013118","journal-title":"J Netw Comput Appl"},{"issue":"11","key":"3342_CR18","first-page":"51","volume":"130","author":"C Hadnagy","year":"2010","unstructured":"Hadnagy C (2010) Social engineering: the art of human hacking. J Quant Spectrosc Radiat Trans 130(11):51\u201361","journal-title":"J Quant Spectrosc Radiat Trans"},{"key":"3342_CR19","doi-asserted-by":"crossref","unstructured":"Halpern J, Teague V (2004) Rational secret sharing and multiparty computation: extended abstract. In: STOC 2004: proceedings of the 36th annum ACM symposium on theory of computing, New York, USA: ACM, pp 623\u2013632","DOI":"10.1145\/1007352.1007447"},{"issue":"2","key":"3342_CR20","first-page":"27","volume":"7","author":"M Ibtihal","year":"2017","unstructured":"Ibtihal M, Driss EO, Hassan N (2017) Homomorphic encryption as a service for outsourced images in mobile cloud computing environment. Int J Cloud Appl Comput 7(2):27\u201340","journal-title":"Int J Cloud Appl Comput"},{"key":"3342_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2822945","author":"RH Jhaveri","year":"2018","unstructured":"Jhaveri RH, Patel NM, Zhong Y, Sangaiah AK (2018) Sensitivity analysis of an attack-pattern discovery based trusted routing scheme for mobile ad-hoc networks in industrial IoT. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2018.2822945","journal-title":"IEEE Access"},{"issue":"1","key":"3342_CR22","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/2906151","volume":"49","author":"W Jiang","year":"2016","unstructured":"Jiang W, Guojun Wang M, Bhuiyan ZA, Jie W (2016) Understanding graph-based trust evaluation in online social networks: methodologies and challenges. ACM Comput Surv (CSUR) 49(1):10","journal-title":"ACM Comput Surv (CSUR)"},{"key":"3342_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0887-z","author":"L Jiang","year":"2018","unstructured":"Jiang L, Cheng Y, Yang L, Li J, Yan H, Wang X (2018) A trust-based collaborative filtering algorithm for e-commerce recommendation system. J Ambient Intell Humaniz Comput. https:\/\/doi.org\/10.1007\/s12652-018-0887-z","journal-title":"J Ambient Intell Humaniz Comput"},{"key":"3342_CR24","doi-asserted-by":"crossref","unstructured":"Katz J (2007) On achieving the best of both worlds in secure multiparty computation. In: Proceedings of the thirty-ninth annual ACM symposium on theory of computing. ACM, pp 11\u201320","DOI":"10.1145\/1250790.1250793"},{"key":"3342_CR25","doi-asserted-by":"crossref","unstructured":"Kumaresan R, Bentov I (2014) How to use bitcoin to incentivize correct computations. In: Proceedings of the 2014 ACM SIGSAC conference on computer and communications security. ACM, pp 30\u201341","DOI":"10.1145\/2660267.2660380"},{"issue":"8","key":"3342_CR26","doi-asserted-by":"publisher","first-page":"1532","DOI":"10.1016\/j.jcss.2014.12.026","volume":"81","author":"J Li","year":"2015","unstructured":"Li J, Chen X, Xhafa F, Barolli L (2015) Secure deduplication storage systems supporting keyword search. J Comput Syst Sci 81(8):1532\u20131541","journal-title":"J Comput Syst Sci"},{"key":"3342_CR27","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.future.2017.02.006","volume":"74","author":"P Li","year":"2017","unstructured":"Li P, Li J, Huang Z, Li T, Gao C-Z, Yiu S-M, Chen K (2017) Multi-key privacy-preserving deep learning in cloud computing. Future Gener Comput Syst 74:76\u201385","journal-title":"Future Gener Comput Syst"},{"key":"3342_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ins.2018.02.056","volume":"444","author":"T Li","year":"2018","unstructured":"Li T, Li J, Liu Z, Li P, Jia C (2018) Differentially private naive bayes learning over multiple data sources. Inf Sci 444:89\u2013104","journal-title":"Inf Sci"},{"key":"3342_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2809426","author":"Q Lin","year":"2018","unstructured":"Lin Q, Yan H, Huang Z, Chen W, Shen J, Tang Y (2018) An id-based linearly homomorphic signature scheme and its application in blockchain. IEEE Access IEEE. https:\/\/doi.org\/10.1109\/ACCESS.2018.2809426","journal-title":"IEEE Access IEEE"},{"issue":"7","key":"3342_CR30","doi-asserted-by":"publisher","first-page":"3244","DOI":"10.1109\/TII.2018.2799928","volume":"14","author":"Zheli Liu","year":"2018","unstructured":"Liu Z, Wu Z, Li T, Li J, Shen C (2018a) GMM and CNN hybrid method for short utterance speaker recognition. IEEE Trans Ind Inform IEEE. https:\/\/doi.org\/10.1109\/TII.2018.2799928","journal-title":"IEEE Transactions on Industrial Informatics"},{"key":"3342_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2018.02.071","volume":"447","author":"Z Liu","year":"2018","unstructured":"Liu Z, Huang Y, Li J, Cheng X, Shen C (2018b) Divoram: towards a practical oblivious ram with variable block size. Inf Sci 447:1\u201311","journal-title":"Inf Sci"},{"key":"3342_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2799854","author":"W Meng","year":"2018","unstructured":"Meng W, Tischhauser E, Wang Q, Wang Y, Han J (2018) When intrusion detection meets blockchain technology: a review. IEEE Access. https:\/\/doi.org\/10.1109\/ACCESS.2018.2799854","journal-title":"IEEE Access"},{"key":"3342_CR33","first-page":"1","volume-title":"Theory of cryptography","author":"T Moran","year":"2009","unstructured":"Moran T, Naor M, Segev G (2009) An optimally fair coin toss. In: Reingold O (ed) Theory of cryptography. Springer, Berlin, pp 1\u201318"},{"key":"3342_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3038-8","author":"H Tian","year":"2018","unstructured":"Tian H, Chen Z, Chang C-C, Huang Y, Wang T, Huang Z, Cai Y, Chen Y (2018) Public audit for operation behavior logs with error locating in cloud storage. Soft Comput. https:\/\/doi.org\/10.1007\/s00500-018-3038-8","journal-title":"Soft Comput"},{"issue":"2","key":"3342_CR35","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00500-015-1773-7","volume":"20","author":"Y Wang","year":"2016","unstructured":"Wang Y, Li T, Chen L, Li P, Leung H, Liu Z, Qiuliang X (2016) Rational computing protocol based on fuzzy theory. Soft Comput 20(2):429\u2013438","journal-title":"Soft Comput"},{"key":"3342_CR36","doi-asserted-by":"crossref","unstructured":"Wang Y, Zhang S, Tang Y, Su Q, Chen B (2018) Rational adversary with flexible utility in secure two-party computation. J Ambient Intell Human Comput, pp 1\u201315","DOI":"10.1007\/s12652-017-0669-z"},{"key":"3342_CR37","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.jnca.2013.10.006","volume":"41","author":"T-Y Wu","year":"2014","unstructured":"Wu T-Y, Lee W-T, Guizani N, Wang T-M (2014) Incentive mechanism for p2p file sharing based on social network and game theory. J Netw Comput Appl 41:47\u201355","journal-title":"J Netw Comput Appl"},{"key":"3342_CR38","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.jnca.2017.12.017","volume":"106","author":"L Yang","year":"2018","unstructured":"Yang L, Han Z, Huang Z, Ma J (2018) A remotely keyed file encryption scheme under mobile cloud computing. J Netw Comput Appl 106:90\u201399","journal-title":"J Netw Comput Appl"},{"key":"3342_CR39","doi-asserted-by":"crossref","unstructured":"Yao AC (1982) Protocols for secure computations. In: 23rd annual symposium on foundations of computer science, 1982. SFCS\u201908. IEEE, pp 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"issue":"4","key":"3342_CR40","doi-asserted-by":"publisher","first-page":"4585","DOI":"10.1007\/s11042-017-4637-6","volume":"77","author":"C Yu","year":"2018","unstructured":"Yu C, Li J, Li X, Ren X, Gupta BB (2018) Four-image encryption scheme based on quaternion fresnel transform, chaos and computer generated hologram. Multimed Tools Appl 77(4):4585\u20134608","journal-title":"Multimed Tools Appl"},{"key":"3342_CR41","doi-asserted-by":"publisher","first-page":"9292","DOI":"10.1109\/ACCESS.2018.2802783","volume":"6","author":"X Zhang","year":"2018","unstructured":"Zhang X, Tan Y-A, Liang C, Li Y, Li J (2018) A covert channel over volte via adjusting silence periods. IEEE Access 6:9292\u20139302","journal-title":"IEEE Access"},{"issue":"3","key":"3342_CR42","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1016\/j.jnca.2011.03.011","volume":"35","author":"H Zhao","year":"2012","unstructured":"Zhao H, Yang X, Li X (2012) An incentive mechanism to reinforce truthful reports in reputation systems. J Netw Comput Appl 35(3):951\u2013961","journal-title":"J Netw Comput Appl"},{"issue":"99","key":"3342_CR43","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/ACCESS.2017.2775038","volume":"6","author":"Q Zheng","year":"2018","unstructured":"Zheng Q, Wang X, Muhammad KK, Wenfang Z, Gupta BB, Wei G (2018) A lightweight authenticated encryption scheme based on chaotic scml for railway cloud service. IEEE Access 6(99):711\u2013722","journal-title":"IEEE Access"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3342-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3342-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T09:05:11Z","timestamp":1693731911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3342-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,22]]},"references-count":43,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["3342"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3342-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,6,22]]},"assertion":[{"value":"22 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"This study was funded by National Natural Science Foundation of China (Grant Number: 61502218, 61771231), Natural Science Foundation of Shandong Province (Grant Number: ZR2017MF010, ZR2017MF062), H. Zhou was funded by EU H2020 DOMINOES Project (Grant Number: 771066).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}