Orthogonality between Key Privacy and Data Privacy, Revisited
暂无分享,去创建一个
[1] Keisuke Tanaka,et al. PA in the Two-Key Setting and a Generic Conversion for Encryption with Anonymity , 2006, ACISP.
[2] E. Fujisaki. Plaintext Simulatability(Public Key Cryptography, Cryptography and Information Security) , 2006 .
[3] Mihir Bellare,et al. Towards Plaintext-Aware Public-Key Encryption Without Random Oracles , 2004, ASIACRYPT.
[4] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[5] Masayuki Abe,et al. Combining Encryption and Proof of Knowledge in the Random Oracle Model , 2004, Comput. J..
[6] Eiichiro Fujisaki. Plaintext Simulatability , 2004, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..
[7] Silvio Micali,et al. Plaintext Awareness via Key Registration , 2003, CRYPTO.
[8] Hugo Krawczyk,et al. Relaxing Chosen-Ciphertext Security , 2003, CRYPTO.
[9] Dan Boneh,et al. Advances in Cryptology - CRYPTO 2003 , 2003, Lecture Notes in Computer Science.
[10] Joonsang Baek,et al. On the Necessity of Strong Assumptions for the Security of a Class of Asymmetric Encryption Schemes , 2002, ACISP.
[11] Tal Rabin,et al. On the Security of Joint Signature and Encryption , 2002, EUROCRYPT.
[12] Aggelos Kiayias,et al. Traitor Tracing with Constant Transmission Rate , 2002, EUROCRYPT.
[13] Mihir Bellare,et al. Key-Privacy in Public-Key Encryption , 2001, ASIACRYPT.
[14] David Pointcheval,et al. REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform , 2001, CT-RSA.
[15] Mihir Bellare,et al. The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES , 2001, CT-RSA.
[16] David Pointcheval,et al. The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes , 2001, Public Key Cryptography.
[17] Colin Boyd,et al. Advances in Cryptology - ASIACRYPT 2001 , 2001 .
[18] David Naccache,et al. Topics in Cryptology — CT-RSA 2001 , 2001, Lecture Notes in Computer Science.
[19] Pil Joong Lee,et al. Advances in Cryptology — ASIACRYPT 2001 , 2001, Lecture Notes in Computer Science.
[20] Ueli Maurer,et al. Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.
[21] Walter Fumy,et al. Advances in Cryptology — EUROCRYPT ’97 , 2001, Lecture Notes in Computer Science.
[22] Markus Jakobsson,et al. Security of Signed ElGamal Encryption , 2000, ASIACRYPT.
[23] Tatsuaki Okamoto,et al. Advances in Cryptology — ASIACRYPT 2000 , 2000, Lecture Notes in Computer Science.
[24] Tatsuaki Okamoto,et al. How to Enhance the Security of Public-Key Encryption at Minimum Cost , 1999, Public Key Cryptography.
[25] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[26] Mihir Bellare,et al. DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem , 1999, IACR Cryptol. ePrint Arch..
[27] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[28] Mihir Bellare,et al. Relations among Notions of Security for Public-Key Encryption Schemes , 1998, IACR Cryptol. ePrint Arch..
[29] Yiannis Tsiounis,et al. On the Security of ElGamal Based Encryption , 1998, Public Key Cryptography.
[30] Hugo Krawczyk,et al. Advances in Cryptology - CRYPTO '98 , 1998 .
[31] Moti Yung,et al. On the Security of ElGamal based , 1998 .
[32] Victor Shoup,et al. Lower Bounds for Discrete Logarithms and Related Problems , 1997, EUROCRYPT.
[33] Jacques Stern,et al. Security Proofs for Signature Schemes , 1996, EUROCRYPT.
[34] Information Security and Privacy , 1996, Lecture Notes in Computer Science.
[35] Mihir Bellare,et al. Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .
[36] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[37] Alfredo De Santis,et al. Advances in Cryptology — EUROCRYPT'94 , 1994, Lecture Notes in Computer Science.
[38] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[39] Daniel R. Simon,et al. Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack , 1991, CRYPTO.
[40] Moni Naor,et al. Non-malleable cryptography , 1991, STOC '91.
[41] Arto Salomaa,et al. Public-Key Cryptography , 1991, EATCS Monographs on Theoretical Computer Science.
[42] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[43] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[44] T. Elgamal. A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.
[45] Silvio Micali,et al. Probabilistic Encryption , 1984, J. Comput. Syst. Sci..