Building Lossy Trapdoor Functions from Lossy Encryption
暂无分享,去创建一个
[1] Scott Yilek,et al. Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions , 2010, Public Key Cryptography.
[2] Brent Waters,et al. Lossy trapdoor functions and their applications , 2008, SIAM J. Comput..
[3] Adam O'Neill,et al. Adaptive Trapdoor Functions and Chosen-Ciphertext Security , 2010, EUROCRYPT.
[4] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[5] Kai-Min Chung,et al. Randomness-Dependent Message Security , 2013, TCC.
[6] John Black,et al. Encryption-Scheme Security in the Presence of Key-Dependent Messages , 2002, Selected Areas in Cryptography.
[7] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[8] Yevgeniy Vahlis,et al. Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs , 2010, TCC.
[9] David Cash,et al. Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems , 2009, CRYPTO.
[10] Tal Malkin,et al. On the impossibility of basing trapdoor functions on trapdoor predicates , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[11] Amit Sahai,et al. Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems , 1998, CRYPTO.
[12] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[13] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[14] Gil Segev,et al. Chosen-Ciphertext Security via Correlated Products , 2009, SIAM J. Comput..
[15] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[16] Mihir Bellare,et al. Deterministic and Efficiently Searchable Encryption , 2007, CRYPTO.
[17] Oded Goldreich,et al. More Constructions of Lossy and Correlation-Secure Trapdoor Functions , 2011, Journal of Cryptology.
[18] Rafail Ostrovsky,et al. Extended-DDH and Lossy Trapdoor Functions , 2012, Public Key Cryptography.
[19] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[20] Gil Segev,et al. Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption , 2008, IACR Cryptol. ePrint Arch..
[21] Dennis Hofheinz,et al. Towards Key-Dependent Message Security in the Standard Model , 2008, EUROCRYPT.
[22] Mihir Bellare,et al. Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening , 2009, EUROCRYPT.
[23] Rafail Ostrovsky,et al. Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security , 2011, ASIACRYPT.
[24] Rafail Ostrovsky,et al. Circular-Secure Encryption from Decision Diffie-Hellman , 2008, CRYPTO.
[25] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[26] Jan Camenisch,et al. An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation , 2001, IACR Cryptol. ePrint Arch..
[27] Moni Naor,et al. Cryptography and Game Theory: Designing Protocols for Exchanging Information , 2008, TCC.
[28] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.