Blind Identity-Based Encryption and Simulatable Oblivious Transfer
暂无分享,去创建一个
[1] Moni Naor,et al. Efficient oblivious transfer protocols , 2001, SODA '01.
[2] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[3] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[4] Rafail Ostrovsky,et al. Public Key Encryption with Keyword Search , 2004, EUROCRYPT.
[5] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[6] Clifford C. Cocks. An Identity Based Encryption Scheme Based on Quadratic Residues , 2001, IMACC.
[7] Fabrice Boudot,et al. Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.
[8] Sanjit Chatterjee,et al. HIBE With Short Public Parameters Without Random Oracle , 2006, ASIACRYPT.
[9] Pascale Charpin,et al. Special Issue on Coding and Cryptography , 2006, Discret. Appl. Math..
[10] Vipul Goyal,et al. Reducing Trust in the PKG in Identity Based Cryptosystems , 2007, CRYPTO.
[11] Alexandra Boldyreva,et al. Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .
[12] Matthew Green,et al. Universally Composable Adaptive Oblivious Transfer , 2008, IACR Cryptol. ePrint Arch..
[13] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[14] Shingo MIYAZAKI,et al. A More Efficient Untraceable E-Cash System with Partially Blind Signatures Based on the Discrete Logarithm Problem , 1998, Financial Cryptography.
[15] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[16] Yiannis Tsiounis,et al. Easy Come - Easy Go Divisible Cash , 1998, EUROCRYPT.
[17] Patricia L. V. Ribeiro,et al. SPACE-EFFICIENT IDENTITY-BASED ENCRYPTION , 2009 .
[18] Tatsuaki Okamoto,et al. Efficient Blind and Partially Blind Signatures Without Random Oracles , 2006, IACR Cryptol. ePrint Arch..
[19] Jan Camenisch,et al. Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes , 1998, EUROCRYPT.
[20] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[21] Abhi Shelat,et al. Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.
[22] Brent Waters,et al. A Framework for Efficient and Composable Oblivious Transfer , 2008, CRYPTO.
[23] Craig Gentry,et al. Practical Identity-Based Encryption Without Random Oracles , 2006, EUROCRYPT.
[24] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[25] Amos Fiat,et al. How to Prove Yourself: Practical Solutions to Identification and Signature Problems , 1986, CRYPTO.
[26] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[27] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[28] David Naccache,et al. Secure and Practical Identity-based Encryption , 2005 .
[29] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[30] Yehuda Lindell,et al. Efficient Fully-Simulatable Oblivious Transfer , 2008, Chic. J. Theor. Comput. Sci..
[31] Silvio Micali,et al. Non-Interactive Oblivious Transfer and Spplications , 1989, CRYPTO.
[32] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[33] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[34] Brent Waters,et al. Building an Encrypted and Searchable Audit Log , 2004, NDSS.
[35] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[36] Ronen Shaltiel,et al. Constant-Round Oblivious Transfer in the Bounded Storage Model , 2004, Journal of Cryptology.
[37] Torben P. Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.
[38] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[39] Sanjit Chatterjee,et al. Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model , 2005, ICISC.
[40] Moni Naor,et al. Adaptively secure multi-party computation , 1996, STOC '96.
[41] Wen-Guey Tzeng,et al. Efficient k-out-of-n Oblivious Transfer Schemes , 2005, J. Univers. Comput. Sci..
[42] Jonathan Katz,et al. Chosen-Ciphertext Security from Identity-Based Encryption , 2004, SIAM J. Comput..
[43] Brent Waters,et al. Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles) , 2006, CRYPTO.
[44] Moni Naor,et al. Oblivious transfer and polynomial evaluation , 1999, STOC '99.
[45] Kaoru Kurosawa,et al. Oblivious keyword search , 2004, J. Complex..
[46] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[47] Jung Hee Cheon,et al. Security Analysis of the Strong Diffie-Hellman Problem , 2006, EUROCRYPT.
[48] Moni Naor,et al. Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.
[49] Liqun Chen,et al. Identity-based key agreement protocols from pairings , 2017, International Journal of Information Security.
[50] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[51] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.