搜索结果: 1-6 共查到“密码学 non-malleable commitments”相关记录6条 . 查询时间(0.093 秒)
One-Message Zero Knowledge and Non-Malleable Commitments
Zero-Knowledge Non-Malleable-Commitments Concurrency
<
2018/6/25
We introduce a new notion of one-message zero-knowledge (1ZK) arguments that satisfy a weak soundness guarantee — the number of false statements that a polynomial-time non-uniform adversary can convin...
Two-Message Non-Malleable Commitments from Standard Sub-exponential Assumptions
non-malleable commitments two rounds
<
2017/4/5
Despite fifteen years of research on the round complexity of non-malleable commitments, their exact round complexity has remained open. In particular, the goal of achieving non-malleable commitment pr...
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
non-malleability commitments PoKs
<
2016/6/6
The round complexity of commitment schemes secure against man-in-the-middle attacks has
been the focus of extensive research for about 25 years. The recent breakthrough of Goyal,
Pandey and Richelso...
Textbook Non-Malleable Commitments
foundations Textbook
<
2015/12/18
The protocol has only three rounds of interaction. Pass (TCC 2013) showed an impossibility result
for a two-round non-malleable commitment scheme w.r.t. a black-box reduction to any “standard"
intra...
Constant-round Non-Malleable Commitments from Any One-Way Function
Non-Malleability Constant-round One-Way Function
<
2010/9/14
We show \emph{unconditionally} that the existence of commitment schemes implies the existence of \emph{constant-round} non-malleable commitments; earlier protocols required additional assumptions such...
Constant-Round Concurrent Non-Malleable Commitments and Decommitments
commitments definitions non-malleability
<
2009/6/5
In this paper we consider commitment schemes that are secure against concurrent
poly-time man-in-the-middle (cMiM) attacks. Under such attacks, two possible notions
of security for commitment scheme...