Detecting a Homoglyph in a String of Characters
A method for detecting a homoglyph in an input text includes receiving a first string of characters and deobfuscating the first string of characters to generate a second string of characters. When at least one character from the first string of characters has replaced another character in the second...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | MacDermed, Liam Charles Brown, Aaron Michael Kovuri, Pranoy |
| description | A method for detecting a homoglyph in an input text includes receiving a first string of characters and deobfuscating the first string of characters to generate a second string of characters. When at least one character from the first string of characters has replaced another character in the second string of characters based on the deobfuscating, the method further includes determining a visual similarity value based on the first string of characters and the second string of characters and providing an indication whether a homoglyph is present in the first string of characters, based on the visual similarity value. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2024346840A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2024346840A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2024346840A13</originalsourceid><addsrcrecordid>eNrjZNB3SS1JTS7JzEtXSFTwyM_NT8-pLMhQyMwDcoNLikDi-WkKzhmJRYnJJalFxTwMrGmJOcWpvFCam0HZzTXE2UM3tSA_PrW4IDE5NS-1JD402MjAyMTYxMzCxMDR0Jg4VQCBeisf</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Detecting a Homoglyph in a String of Characters</title><source>esp@cenet</source><creator>MacDermed, Liam Charles ; Brown, Aaron Michael ; Kovuri, Pranoy</creator><creatorcontrib>MacDermed, Liam Charles ; Brown, Aaron Michael ; Kovuri, Pranoy</creatorcontrib><description>A method for detecting a homoglyph in an input text includes receiving a first string of characters and deobfuscating the first string of characters to generate a second string of characters. When at least one character from the first string of characters has replaced another character in the second string of characters based on the deobfuscating, the method further includes determining a visual similarity value based on the first string of characters and the second string of characters and providing an indication whether a homoglyph is present in the first string of characters, based on the visual similarity value.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; PHYSICS</subject><creationdate>2024</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20241017&DB=EPODOC&CC=US&NR=2024346840A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25543,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20241017&DB=EPODOC&CC=US&NR=2024346840A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MacDermed, Liam Charles</creatorcontrib><creatorcontrib>Brown, Aaron Michael</creatorcontrib><creatorcontrib>Kovuri, Pranoy</creatorcontrib><title>Detecting a Homoglyph in a String of Characters</title><description>A method for detecting a homoglyph in an input text includes receiving a first string of characters and deobfuscating the first string of characters to generate a second string of characters. When at least one character from the first string of characters has replaced another character in the second string of characters based on the deobfuscating, the method further includes determining a visual similarity value based on the first string of characters and the second string of characters and providing an indication whether a homoglyph is present in the first string of characters, based on the visual similarity value.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2024</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZNB3SS1JTS7JzEtXSFTwyM_NT8-pLMhQyMwDcoNLikDi-WkKzhmJRYnJJalFxTwMrGmJOcWpvFCam0HZzTXE2UM3tSA_PrW4IDE5NS-1JD402MjAyMTYxMzCxMDR0Jg4VQCBeisf</recordid><startdate>20241017</startdate><enddate>20241017</enddate><creator>MacDermed, Liam Charles</creator><creator>Brown, Aaron Michael</creator><creator>Kovuri, Pranoy</creator><scope>EVB</scope></search><sort><creationdate>20241017</creationdate><title>Detecting a Homoglyph in a String of Characters</title><author>MacDermed, Liam Charles ; Brown, Aaron Michael ; Kovuri, Pranoy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2024346840A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2024</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>MacDermed, Liam Charles</creatorcontrib><creatorcontrib>Brown, Aaron Michael</creatorcontrib><creatorcontrib>Kovuri, Pranoy</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MacDermed, Liam Charles</au><au>Brown, Aaron Michael</au><au>Kovuri, Pranoy</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Detecting a Homoglyph in a String of Characters</title><date>2024-10-17</date><risdate>2024</risdate><abstract>A method for detecting a homoglyph in an input text includes receiving a first string of characters and deobfuscating the first string of characters to generate a second string of characters. When at least one character from the first string of characters has replaced another character in the second string of characters based on the deobfuscating, the method further includes determining a visual similarity value based on the first string of characters and the second string of characters and providing an indication whether a homoglyph is present in the first string of characters, based on the visual similarity value.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2024346840A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING PHYSICS |
| title | Detecting a Homoglyph in a String of Characters |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T20%3A09%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=MacDermed,%20Liam%20Charles&rft.date=2024-10-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2024346840A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |