搜索结果: 1-5 共查到“Non-malleable protocols”相关记录5条 . 查询时间(0.123 秒)
By instantiating our compilers with known candidate constructions, the resulting schemes improve the current state of the art in light of subtleties that revisit the analysis of previous work. Additio...
A New Family of Practical Non-Malleable Protocols
Practical Non-Malleable Protocols cryptosystems secure an asynchronous network
2011/2/23
Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent non-malleable proof-of-knowledge and universal composability are amo...
Nowadays, achieving cryptosystems secure in an asynchronous network like the Internet is demanded to be necessary, where concurrent non-malleable proof-of-knowledge and universal composability are amo...
Constant Round Non-Malleable Protocols using One Way Functions
Constant Round Non-Malleable Protocols One Way Functions
2010/9/21
We provide a new construction for constant round non-malleable commitments and zero-knowledge. Our construction can be based on any one way function. This improves upon several previous results which ...
Non-black-box Techniques Are Not Necessary for Constant Round Non-malleable Protocols
Non-black-box Techniques Constant Round Non-malleable Protocols generic adversaries
2009/6/3
Recently, non-black-box techniques have enjoyed great success in cryptography. In particular, they
have led to the construction of constant round protocols for two basic cryptographic tasks (in the p...