摘要: Providing anonymity support for peer-to-peer (P2P) overlay networks is critical. Otherwise, potential privacy attacks (e.g., network address traceback) may deter a storage source from providing the needed data. In this paper we use practical application scenario to verify our observation that network-based can be modeled as complexity based cryptographic problem. We show that, if routing process between senders and recipients abstract entities, becomes an analogy of cryptography. particular, perfect facing unbounded traffic analyst corresponds Shannon’s secrecy cryptanalyst. More importantly, in propose Probabilistic Polynomial Route (PPR) model, which new polynomially-bounded model corresponding Time (PPT ) Afterwards, are with no exception BPP. This phenomenon has not been discovered previous research. Keywords—Formal notion anonymity; model; Chosen Recipient Attack; Sender P2P network.
参考文章(29)
Arjen K. Lenstra, Eric R. Verheul, Selecting Cryptographic Key Sizes public key cryptography. pp. 446- 465 ,(2000) , 10.1007/978-3-540-46588-1_30
Ivan Bjerre Damgård, Collision free hash functions and public key signature schemes theory and application of cryptographic techniques. ,vol. 304, pp. 203- 216 ,(1987) , 10.1007/3-540-39118-5_19
Ron Berman, Amos Fiat, Amnon Ta-Shma, Provable unlinkability against traffic analysis financial cryptography. pp. 266- 280 ,(2004) , 10.1007/978-3-540-27809-2_26
Adi Shamir, Identity-based cryptosystems and signature schemes international cryptology conference. ,vol. 196, pp. 47- 53 ,(1985) , 10.1007/3-540-39568-7_5
Charles Rackoff, Daniel R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack international cryptology conference. pp. 433- 444 ,(1991) , 10.1007/3-540-46766-1_35
M. Naor, M. Yung, Universal one-way hash functions and their cryptographic applications Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 33- 43 ,(1989) , 10.1145/73007.73011
Charles Rackoff, Daniel R. Simon, Cryptographic defense against traffic analysis Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93. pp. 672- 681 ,(1993) , 10.1145/167088.167260
G. S. Vernam, Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications Transactions of The American Institute of Electrical Engineers. ,vol. 45, pp. 295- 301 ,(1926) , 10.1109/T-AIEE.1926.5061224
M.G. Reed, P.F. Syverson, D.M. Goldschlag, Anonymous connections and onion routing IEEE Journal on Selected Areas in Communications. ,vol. 16, pp. 482- 494 ,(1998) , 10.1109/49.668972
Shlomi Dolev, Rafail Ostrobsky, Xor-trees for efficient anonymous multicast and reception ACM Transactions on Information and System Security. ,vol. 3, pp. 63- 84 ,(2000) , 10.1145/354876.354877