基于裸公钥的自适应并发不可延展性
Adaptive Concurrent Non-Malleability with Bare Public-Keys
摘要：
并发不可延展性（CNM）是在Internet等环境中并发运行的密码协议的核心。在这项工作中，我们制定CNM裸公钥（BPK）模型，并表明，轮有效的并发非延展性密码与完全自适应输入选择可以建立，在一般情况下，与裸公钥（其中，特别是，没有可信的假设）。一路上，我们澄清了裸公钥模型中自适应并发不可延展性的各种微妙之处。
英文摘要：
Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently in environments such as the Internet. In this work, we formulate CNM in the bare public-key (BPK) model, and show that round-efficient concurrent non-malleable cryptography with full adaptive input selection can be established, in general, with bare public-keys (where, in particular, no trusted assumption is made). Along the way, we clarify the various subtleties of adaptive concurrent non-malleability in the bare public-key model.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
