Optimal asymmetric encryption
作者： Mihir Bellare , Phillip Rogaway
DOI: 10.1007/BFB0053428
关键词: Discrete mathematics 、 Chosen-ciphertext attack 、 Hash function 、 Cryptographic hash function 、 Hash chain 、 SHA-2 、 MDC-2 、 Collision attack 、 Plaintext-aware encryption 、 Computer science
摘要: … In the find-stage it is given an encryption algorithm s and outputs a pair z0, zt of messages. It also outputs a string c which could record, for example, its history and its inputs. Now we …
springer.com
sci-hub.se 参考文章(23)
Yuliang Zheng, Jennifer Seberry, Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks international cryptology conference. pp. 292- 304 ,(1992) , 10.1007/3-540-48071-4_20
M. O. Rabin, DIGITALIZED SIGNATURES AND PUBLIC-KEY FUNCTIONS AS INTRACTABLE AS FACTORIZATION MIT Laboratory for Computer Science. ,(1979)
Manuel Blum, Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information international cryptology conference. pp. 289- 302 ,(1985) , 10.1007/3-540-39568-7_23
C. P. Schnorr, Efficient Identification and Signatures for Smart Cards international cryptology conference. pp. 239- 252 ,(1989) , 10.1007/0-387-34805-0_22
Shafi Goldwasser, Silvio Micali, Charles Rackoff, The knowledge complexity of interactive proof systems SIAM Journal on Computing. ,vol. 18, pp. 186- 208 ,(1989) , 10.1137/0218012
Uriel Feige, Amos Fiat, Adi Shamir, Zero-knowledge proofs of identity Journal of Cryptology. ,vol. 1, pp. 77- 94 ,(1988) , 10.1007/BF02351717
R. L. Rivest, A. Shamir, L. Adleman, A method for obtaining digital signatures and public-key cryptosystems Communications of the ACM. ,vol. 26, pp. 96- 99 ,(1983) , 10.1145/357980.358017
A. W. Schrift, A. Shamir, The discrete log is very discreet symposium on the theory of computing. pp. 405- 415 ,(1990) , 10.1145/100216.100271
O. Goldreich, L. A. Levin, A hard-core predicate for all one-way functions Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89. pp. 25- 32 ,(1989) , 10.1145/73007.73010
Mihir Bellare, Phillip Rogaway, Random oracles are practical: a paradigm for designing efficient protocols computer and communications security. pp. 62- 73 ,(1993) , 10.1145/168588.168596