{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T20:40:17Z","timestamp":1689626417180},"reference-count":21,"publisher":"International Academy Publishing (IAP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSW"],"DOI":"10.4304\/jsw.9.10.2538-2545","type":"journal-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T21:00:48Z","timestamp":1415048448000},"source":"Crossref","is-referenced-by-count":0,"title":["Trusted Puzzle Solvers without Clock Support against Spam and Denial-of-Service Attacks"],"prefix":"10.17706","volume":"9","author":[{"given":"Rui","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zuoning","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7163","published-online":{"date-parts":[[2014,10,1]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.7.11.2612-2616"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359473"},{"key":"ref3","first-page":"170","article-title":"DoS-Resistant Authentication with Client Puzzles","volume-title":"Proc Security Protocols Workshop 2000","author":"Aura","year":"2000","unstructured":"[5] T. Aura, P. Nikander, and J. Leiwo, DoS-Resistant Authentication with Client Puzzles, Proc. Security Protocols Workshop 2000, Springer-Verlag, New York, 2000: 170-177"},{"key":"ref4","first-page":"281","article-title":"Protection Against Spam Using Pre-Challenges.","volume-title":"SEC","author":"Roman","year":"2005","unstructured":"[7] R. Roman, J. Zhou, and J. Lopez. Protection Against Spam Using Pre-Challenges.In SEC, Springer, 2005: 281-294"},{"key":"ref5","first-page":"45","article-title":"Phalanx: Withstanding multimillion-node botnets.","volume-title":"Proc NSDI","author":"Dixon","year":"2008","unstructured":"[12] C. Dixon, T.Anderson, and A. Krishnamurthy. Phalanx: Withstanding multimillion-node botnets. Proc. NSDI,2008.45-58."},{"key":"ref6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/1282380.1282413","article-title":"Portcullis:Protecting connection setup from denial-of-capability attacks.","volume-title":"Proc ACM SIGCOMM","author":"Parno","year":"2007","unstructured":"[13] B.Parno,D.Wendlandt, E.Shi,A.Perrig,B.Maggs,and Y.Hu. Portcullis:Protecting connection setup from denial-of-capability attacks. Proc. ACM SIGCOMM,2007: 289-300"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.7.10.2397-2403"},{"key":"ref8","first-page":"171","article-title":"Computational Puzzles as Sybil Defenses.","volume-title":"Peer-to-Peer Computing","author":"Borisov","year":"2006","unstructured":"[15] N. Borisov. Computational Puzzles as Sybil Defenses. In Peer-to-Peer Computing, IEEE Computer Society, 2006, 171-176"},{"key":"ref9","first-page":"151","article-title":"Auditable Metering with Lightweight Security","volume-title":"LNCS Springer","volume":"1318","author":"Franklin","year":"1997","unstructured":"[17] M. K. Franklin and D. Malkhi. Auditable Metering with Lightweight Security. In Financial Cryptography, volume 1318 of LNCS, Springer, 1997: 151-160."},{"key":"ref10","first-page":"2P","article-title":"Puzzles","volume-title":"8th Cabernet Radicals Workshop","author":"Serjantov","year":"2003","unstructured":"[18] A. Serjantov and S. Lewis. Puzzles in P2P systems. In 8th Cabernet Radicals Workshop, Oct 2003."},{"key":"ref11","first-page":"151","article-title":"Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks.","volume-title":"NDSS","author":"Juels","year":"1999","unstructured":"[19] A. Juels and J. G. Brainard. Client Puzzles: A Cryptographic Countermeasure Against Connection Depletion Attacks. In NDSS. The Internet Society, 1999, 151-165."},{"key":"ref12","first-page":"284","article-title":"Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols","volume":"6558","author":"Stebila","year":"2011","unstructured":"[20] Douglas Stebila. Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols,LNCS,volume 6558,2011:284-301.","journal-title":"LNCS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45748-8_24"},{"key":"ref14","first-page":"504","article-title":"Scalable, Server-Passive, User-Anonymous Timed Release Cryptography.","volume-title":"ICDCS","author":"Chan","year":"2005","unstructured":"[26] A.C.-F. Chan and I. F. Blake. Scalable, Server-Passive, User-Anonymous Timed Release Cryptography. In ICDCS, IEEE Computer Society,2005:504-513"},{"key":"ref15","first-page":"311","article-title":"Improved Anonymous Timed-Release Encryption, in ESORICS 2007","volume-title":"Proceedings of the 12th European Symposium On Research In Computer Security","author":"Chalkias","year":"2007","unstructured":"[27] K. Chalkias, D. Hristu-Varsakelis, and G. Stephanides, Improved Anonymous Timed-Release Encryption, in ESORICS 2007: Proceedings of the 12th European Symposium On Research In Computer Security, Sep.2007:311-326"},{"key":"ref16","first-page":"168","article-title":"Timed Release of Standard Digtigal Signatures","volume-title":"LNCS Springer","volume":"2357","author":"Garay","year":"2002","unstructured":"[28] J. A. Garay and M. Jakobsson. Timed Release of Standard Digtigal Signatures. In Financial Cryptography, volume 2357 of LNCS, Springer,2002:168-182"},{"key":"ref17","first-page":"1058","volume-title":"Proceedings of the 10th IEEE International Conference on Computer and Information Technology","author":"Jerschow","year":"2010","unstructured":"[31] Y. I. Jerschow, M. Mauve, Offline Submission with RSA Time-Lock Puzzles,in: CIT 2010: Proceedings of the 10th IEEE International Conference on Computer and Information Technology, 2010: 1058-1064"},{"key":"ref18","volume-title":"TCG TPM Speci_cation Version 1 2 Revision 103 Technical report","year":"2007","unstructured":"[32] TPM Work Group. TCG TPM Speci_cation Version 1.2 Revision 103. Technical report, Trusted Computing Group, 2007."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79104-1_14"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.8.7.1763-1770"},{"key":"ref21","first-page":"607","article-title":"Efficient Client Puzzles based on Repeated-Squaring.","volume-title":"Proceedings of IACR Cryptology ePrint Archive","author":"Karame","year":"2009","unstructured":"[35] G. Karame and S. Capkun, Efficient Client Puzzles based on Repeated-Squaring.;In Proceedings of IACR Cryptology ePrint Archive. 2009:607-607"}],"container-title":["Journal of Software"],"original-title":[],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T20:22:00Z","timestamp":1689625320000},"score":1,"resource":{"primary":{"URL":"http:\/\/ojs.academypublisher.com\/index.php\/jsw\/article\/view\/12496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":21,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2014,10,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jsw.9.10.2538-2545","relation":{},"ISSN":["1796-217X"],"issn-type":[{"value":"1796-217X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}