流可否认加密在计算上与概率加密难以区分

A. N. Berezin, A. Moldovyan, N. A. Moldovyan
{"title":"流可否认加密在计算上与概率加密难以区分","authors":"A. N. Berezin, A. Moldovyan, N. A. Moldovyan","doi":"10.1109/SCM.2015.7190395","DOIUrl":null,"url":null,"abstract":"For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they open the fake key with which the cryptogram is transformed into the fake message. To recover the secret message from the cryptogram the receiver uses the secret key. The algorithm is constructed on the base of some secure hash function with which two key streams are generated. The key streams are mixed with secret data stream and with fake data stream so that cryptograms looks like the ciphertext produced by the probabilistic encryption of the fake message with the fake key.","PeriodicalId":106868,"journal":{"name":"2015 XVIII International Conference on Soft Computing and Measurements (SCM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Stream deniable-encryption computationally indistinguishable from probabilistic ciphering\",\"authors\":\"A. N. Berezin, A. Moldovyan, N. A. Moldovyan\",\"doi\":\"10.1109/SCM.2015.7190395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they open the fake key with which the cryptogram is transformed into the fake message. To recover the secret message from the cryptogram the receiver uses the secret key. The algorithm is constructed on the base of some secure hash function with which two key streams are generated. The key streams are mixed with secret data stream and with fake data stream so that cryptograms looks like the ciphertext produced by the probabilistic encryption of the fake message with the fake key.\",\"PeriodicalId\":106868,\"journal\":{\"name\":\"2015 XVIII International Conference on Soft Computing and Measurements (SCM)\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 XVIII International Conference on Soft Computing and Measurements (SCM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCM.2015.7190395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 XVIII International Conference on Soft Computing and Measurements (SCM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCM.2015.7190395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

首次提出了一种流可否认加密算法。该算法生成的密码在计算上与某些概率加密算法(称为关联概率算法)产生的密码无法区分,同时使用假密钥对假消息进行加密。当消息的发送方和接收方被强制打开加密密钥时,他们会打开假密钥,用假密钥将密码转换为假消息。为了从密码中恢复秘密消息,接收方使用秘密密钥。该算法是在生成两个密钥流的安全哈希函数的基础上构造的。密钥流与秘密数据流和假数据流混合在一起,这样加密看起来就像用假密钥对假消息进行概率加密所产生的密文。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Stream deniable-encryption computationally indistinguishable from probabilistic ciphering
For the first time it is proposed a stream deniable-encryption algorithm. The algorithm generates cryptogram that is computationally indistinguishable from the cryptogram produced by some probabilistic encryption algorithm, called associated probabilistic algorithm, while ciphering a fake message with a fake key. When the sender and receiver of the message are coerced to open the encryption key, they open the fake key with which the cryptogram is transformed into the fake message. To recover the secret message from the cryptogram the receiver uses the secret key. The algorithm is constructed on the base of some secure hash function with which two key streams are generated. The key streams are mixed with secret data stream and with fake data stream so that cryptograms looks like the ciphertext produced by the probabilistic encryption of the fake message with the fake key.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The maintenance of structures Modeling of signals of pulse origin on the basis of sparse approximation scheme Inertialess adaptive algorithms for control of technical objects with limited uncertainty Decision support system based on 4-valued logic with multi-interpretations Evolutionary algorithms for digital electronic printed circuit board design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1