{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T08:56:58Z","timestamp":1730278618174,"version":"3.28.0"},"reference-count":3,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/itwtpi.2005.1543956","type":"proceedings-article","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T15:49:09Z","timestamp":1134229749000},"page":"48-54","source":"Crossref","is-referenced-by-count":1,"title":["Cryptography and decoding reed-solomon codes as a hard problem"],"prefix":"10.1109","author":[{"given":"A.","family":"Kiayias","sequence":"first","affiliation":[]},{"given":"M.","family":"Yung","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"232","article-title":"Cryptographic hardness based on the decoding of reed-solomon codes","volume":"2380","author":"kiayias","year":"2002","journal-title":"LNCS"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480198344540"}],"event":{"name":"IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.","location":"Awaji Island, Japan"},"container-title":["IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10361\/32963\/01543956.pdf?arnumber=1543956","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T11:30:18Z","timestamp":1489491018000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1543956\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":3,"URL":"https:\/\/doi.org\/10.1109\/itwtpi.2005.1543956","relation":{},"subject":[]}}