{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T14:44:40Z","timestamp":1773153880147,"version":"3.50.1"},"reference-count":28,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,21]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Stealth address is a known technique to ensure the privacy (anonymity) of a recipient participating in a certain transaction in a distributed blockchain scenario. However, most existing stealth address schemes require linear judge time and search time $\\mathcal{O}(n)$, where $n$ is the number of transactions of a certain block, so the only way to claim transactions for a recipient is to traverse the transaction list to find out whether an ever-arrived transaction belongs to him. To overcome this drawback, we proposed the notion of Fast Stealth Address (FSA), a novel approach that simultaneously preserves privacy and improves search efficiency of recipients. We give a generic construction of FSA scheme under subgroup membership assumption related to factoring and instantiate concrete schemes based on specific number-theoretic assumptions. Our framework mainly improves on two aspects: (i) allowing constant recognize time $\\mathcal{O}(1)$ to judge whether a certain block contains recipient\u2019s transactions and (ii) allowing logarithmic search time $\\mathcal{O}(\\log{n})$ to find out the precise transactions intended for a recipient. We formalize the security model of an FSA scheme and provide provable security analysis to ensure the security of our constructions. Besides, we implement our schemes to measure their real-world performance on several metrics and give comparison results to stealth address scheme utilized by Monero.<\/jats:p>","DOI":"10.1093\/comjnl\/bxad056","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T16:17:47Z","timestamp":1686327467000},"page":"1253-1264","source":"Crossref","is-referenced-by-count":1,"title":["Stealth Address Schemes With Fast Retrievability Based On Subgroup Membership Assumptions Related To Factoring"],"prefix":"10.1093","volume":"67","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[{"name":"Ant Group , Beijing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Lin","sequence":"additional","affiliation":[{"name":"Ant Group , Beijing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yao","family":"Wang","sequence":"additional","affiliation":[{"name":"Ant Group , Beijing , China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"2024042316175043200_ref1","first-page":"2","article-title":"A peer-to-peer electronic cash system","volume":"4","author":"Nakamoto","year":"2008","journal-title":"Bitcoin"},{"key":"2024042316175043200_ref2","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/11685654_7","article-title":"How to leak a secret: Theory and applications of ring signatures","volume-title":"Theoretical Computer Science","author":"Rivest","year":"2006"},{"key":"2024042316175043200_ref3","first-page":"559","article-title":"Stealth address and key management techniques in blockchain systems","volume-title":"Proceedings of the 3rd International Conference on Information Systems Security and Privacy, ICISSP 2017","author":"Courtois","year":"2017"},{"key":"2024042316175043200_ref4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1109\/SP.2013.34","article-title":"Zerocoin: Anonymous distributed e-cash from bitcoin","volume-title":"2013 IEEE Symposium on Security and Privacy, SP 2013","author":"Miers","year":"2013"},{"key":"2024042316175043200_ref5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1515\/popets-2018-0025","article-title":"An empirical analysis of traceability in the monero blockchain","volume":"2018","author":"M\u00f6ser","year":"2018","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"2024042316175043200_ref6","article-title":"Confidential assets on mimblewimble. Cryptology ePrint archive","author":"Zheng","year":"2019"},{"key":"2024042316175043200_ref7","first-page":"1507","article-title":"Fuzzy message detection","volume-title":"CCS \u201821: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea","author":"Beck","year":"2021"},{"key":"2024042316175043200_ref8","first-page":"3309","article-title":"Private signaling","volume-title":"31st USENIX Security Symposium, USENIX Security 2022","author":"Madathil","year":"2022"},{"key":"2024042316175043200_ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","article-title":"Circular and leakage resilient public-key encryption under subgroup indistinguishability - (or: Quadratic residuosity strikes back)","volume-title":"Advances in Cryptology - CRYPTO 2010, 30th Annual Cryptology Conference","author":"Brakerski","year":"2010"},{"key":"2024042316175043200_ref10","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/3-540-47719-5_18","article-title":"Private information retrieval based on the subgroup membership problem","volume-title":"Information Security and Privacy","author":"Yamamura","year":"2001"},{"key":"2024042316175043200_ref11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/978-3-540-30580-4_8","article-title":"Symmetric subgroup membership problems","volume-title":"Public Key Cryptography - PKC 2005","author":"Gj\u00f8steen","year":"2005"},{"key":"2024042316175043200_ref12","article-title":"The generic hardness of subset membership problems under the factoring assumption. Cryptology ePrint archive","author":"Jager","year":"2008"},{"key":"2024042316175043200_ref13","doi-asserted-by":"crossref","first-page":"103708","DOI":"10.1016\/j.csi.2022.103708","article-title":"Blockchain-empowered security and privacy protection technologies for smart grid","volume":"85","author":"Cao","year":"2023","journal-title":"Comput. Stand. Interfaces"},{"key":"2024042316175043200_ref14","first-page":"1","article-title":"Peer to peer energy transaction market prediction in smart grids using blockchain and LSTM","volume-title":"IEEE International Conference on Consumer Electronics, ICCE 2023","author":"Chien","year":"2023"},{"key":"2024042316175043200_ref15","doi-asserted-by":"crossref","first-page":"100150","DOI":"10.1016\/j.array.2022.100150","article-title":"Blockchain based context-aware CP-ABE schema for internet of medical things security","volume":"14","author":"Annane","year":"2022","journal-title":"Array"},{"key":"2024042316175043200_ref16","doi-asserted-by":"crossref","DOI":"10.1155\/2022\/9957888","article-title":"Blockchain and fog computing in iot-driven healthcare services for smart cities","volume":"2022","author":"Kamruzzaman","year":"2022","journal-title":"J. Healthc. Eng."},{"key":"2024042316175043200_ref17","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/MCE.2021.3140048","article-title":"Blockchain-based medical certificate generation and verification for iot-based healthcare systems","volume":"12","author":"Namasudra","year":"2023","journal-title":"IEEE Consumer Electron. Mag."},{"key":"2024042316175043200_ref18","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10479-022-05033-3","article-title":"Supply chain financing scheme based on blockchain technology from a business application perspective","volume":"320","author":"Tsai","year":"2023","journal-title":"Ann. Oper. Res."},{"key":"2024042316175043200_ref19","doi-asserted-by":"crossref","first-page":"108814","DOI":"10.1016\/j.cie.2022.108814","article-title":"Green blockchain based iot for secured supply chain of hazardous materials","volume":"175","author":"Oudani","year":"2023","journal-title":"Comput. Ind. Eng."},{"key":"2024042316175043200_ref20","first-page":"497","article-title":"Hierarchical deterministic bitcoin wallets that tolerate key leakage","volume-title":"Financial Cryptography and Data Security - 19th International Conference, ref20 2015","author":"Gutoski","year":"2015"},{"key":"2024042316175043200_ref21","author":"Van Saberhagen","year":"2013"},{"key":"2024042316175043200_ref22","article-title":"An empirical analysis of linkability in the monero blockchain","author":"Miller","year":"2017","journal-title":"CoRR"},{"key":"2024042316175043200_ref23","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1504\/IJWGS.2018.095647","article-title":"Blockchain challenges and opportunities: a survey","volume":"14","author":"Zheng","year":"2018","journal-title":"Int. J. Web Grid Serv."},{"key":"2024042316175043200_ref24","article-title":"Blockchain technology overview","author":"Yaga","year":"2019","journal-title":"CoRR"},{"key":"2024042316175043200_ref25","first-page":"1068","article-title":"A general method to construct public key residue cryptosystems","volume":"73","author":"Kurosawa","year":"1990","journal-title":"Trans Ieice"},{"key":"2024042316175043200_ref26","first-page":"48","article-title":"Identification, signature and signcryption using high order residues modulo an RSA composite. Public Key Cryptography","volume-title":"4th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2001","author":"Zheng","year":"2001"},{"key":"2024042316175043200_ref27","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","article-title":"Efficient cryptosystems from 2$^k$-th power residue symbols","volume-title":"Advances in Cryptology - EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Joye","year":"2013"},{"key":"2024042316175043200_ref28","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-319-02937-5_13","article-title":"Efficient lossy trapdoor functions based on subgroup membership assumptions","volume-title":"Cryptology and Network Security - 12th International Conference","author":"Xue","year":"2013"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/4\/1253\/57295651\/bxad056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/67\/4\/1253\/57295651\/bxad056.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T16:22:17Z","timestamp":1713889337000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/67\/4\/1253\/7188840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,6,2]]},"published-print":{"date-parts":[[2024,4,21]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxad056","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2024,4]]},"published":{"date-parts":[[2023,6,2]]}}}