[已徵到] 0.6/字資訊相關英文論文

看板translator (翻譯接案)作者gourkuff (小古)時間13年前 (2013/01/30 00:15)推噓0(0推 0噓 1→)

留言1則, 1人參與討論串1/1

─────── 發表文章時，請按 Ctrl+Y 刪除本行以上內容 ────────── [必]我已經讀過置底版規、參考費率、發文必讀公告，並願意遵守規定：YES * 如已讀過，請填 YES * 如未讀過，請讀過再重新發文。未填視為未讀，一律刪文處理並警告。 ────────────────────────────────────── [必]工作量： 5900字（請載明字數或估算大約總字數。違者直接刪文） [必]工作報酬：英文 0.6元/字 [必]涉及語言：英文 [必]所屬領域：資訊相關密碼學 [必]文件類型：論文 [必]截稿日： 2/6 12:00 [必]應徵期限： 2/2 00:00 [必]聯絡方式： wildwind@crypto.tw [必]付費方式：預付500元訂金，完稿後2天內付清。 ────────────────────────────────────── [選]工作要求：希望譯者擁有相關撰寫經驗若為相關背景者佳 [選]參考段落：（提供部分段落讓譯者評估難度，若未提供請勿刪除） [選]試譯文：（100-200字，並不超過全文1/10。嚴禁私下試譯。若未提供請勿刪除） Therefore, we do not adopt bloom filter at all in our architecture. We also reflect many fields in Solr, so we can separate our original file from different parts, each part has its exclusive key to hash the keyword. The disadvantage is that we use one key to hash the keywords to build an index, the result may leak distributed information to the hacker. We provide a new way to avoid it. The way is we build not only one index server in our architecture. For example, there are four index servers in our work. The hashed keyword is fixed length with 32 bytes. We separate the keyword into four equal lengths, and transmitted to the index server respectively. Therefore, there are collisions in index server because of shorter index. It sounds like generating fake documents to confuse the hacker and the index server itself. While we ask a query, four index servers give us the match set, and we will achieve right files after making intersections. When we referred to secure index in the following chapters, we use our modified version in our work. [選]其他事項：來信者請提供學經歷&潤稿範本三篇請email來信聯絡 ────────────────────────────────────── -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 211.74.227.231

[已徵到] 0.6/字 資訊相關英文論文

[已徵到] 0.6/字資訊相關英文論文