因为公司有一个合作项目牵涉到,这几天抽空看了一下proof of storage的paper,复习了一下本科学的密码学的内容,觉得还是一个很有意思的topic。其中一个reference挺难找的,记在这里吧。下面讨论的原理还是基于大整数的分解问题。
http://diswww.mit.edu/bloom-picayune/crypto/13190
Adi Shamir once proposed the following hash function:
Let n = p*q be the product of two large primes, such that
factoring n is believed to be infeasible.
Let g be an element of maximum order in Z_n^* (i.e. an
element of order lambda(n) = lcm(p-1,q-1)).
Assume that n and g are fixed and public; p and q are secret.
Let x be an input to be hashed, interpreted as a
non-negative integer. (Of arbitrary length; this may be
considerably larger than n.)
Define hash(x) = g^x (mod n).
Then this hash function is provably collision-resistant, since
the ability to find a collision means that you have an x and
an x' such that
hash(x) = hash(x')
which implies that
x - x' = k * lambda(n)
for some k. That is a collision implies that you can find a
multiple of lambda(n). Being able to find a multiple of lambda(n)
means that you can factor n.
I would suggest this meets the specs of your query above.
Cheers,
Ron Rivest
Ronald L. Rivest
Room 324, 200 Technology Square, Cambridge MA 02139
Tel 617-253-5880, Fax 617-258-9738, Email <rivest@mit.edu>
分享到:
相关推荐
非常详细很全面的区块链技术文档,包括论文
Proofs from THE BOOK is a... * Proof that e is irrational (also showing the irrationality of certain related numbers) * Five proofs of the infinitude of the primes, including Euclid's and Furstenberg's.
Public Proof of Cloud Storage from Lattice Assumption
对黎曼猜想的证明,韩金柱,,本文给出了黎曼猜想的一个证明。我们应用L'Hospital法则得到了黎曼zeta函数ζ(s)在非显然零点极限条件A(ρ)=1。由此证明了ζ(s)非显然零点
Riemann假设一个等价命题的证明,朱玉扬,,运用Chebyshev函数与素数定理等证明:存在正常数A,对所有自然数n≥A,那么有 exp(Hn)log(Hn)—σ(n)﹥eγnloglogn—σ(n)﹥0. 这里σ(n)是自然数n�
李雅普诺夫稳定性定理直接法详细证明,附图
Sunny King, Scott Nada讲述POS的一篇论文。PPC是从中本聪所创造的BTC衍生出来的一种P2P的电子密码货币,以权益证明(Proof of Stake,以下简称POS)取代工作量证明(Proof of Work,以下简称POW)来维护网络安全。
a proof of the central limit theorem For Statistics Inference
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Go implementation of Ethereum proof of stake
This is a free book about how to prove theorems. It is organized into four parts: Fundamentals, proving conditional statements, more on proof, relations, functions and cardinality.
THE PROOF OF FERMAT’S LAST THEOREM
有关zate函数值无理性的经典论文,作者应用初等方法证明Apery理论,简单易读
一个Poncelet定理的简单证明
僵尸网络在现今的网络安全威胁中扮演着不可忽略的角色。僵尸网络可以被用来发送垃圾邮件,发起DDoS(分布式拒绝服务)攻击,可以大规模窃取受害者的隐私。本文是针对僵尸发动的DDoS攻击提出了一些防御策略。
This leads to an elementary proof of the Restricted Isometry Property and brings out connections between Compressed Sensing and the Johnson-Lindenstrauss lemma. As a result, we obtain simple and ...
A Short Proof of the Simple Continued Fraction Expansion of e
Insecurity of Public Proof of Cloud Storage from Lattice Assumption(第1作者为许春香指导的博士生)