Secure Blind Decryption
暂无分享,去创建一个
[1] Kouichi Sakurai,et al. How to Utilize the Transformability of Digital Signatures for Solving the Oracle Problem , 1996, ASIACRYPT.
[2] Qixiang Mei,et al. Direct chosen ciphertext security from identity-based techniques , 2005, CCS '05.
[3] A. Yao,et al. Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.
[4] Jonathan Katz,et al. A Forward-Secure Public-Key Encryption Scheme , 2003, Journal of Cryptology.
[5] Joe Kilian,et al. Founding crytpography on oblivious transfer , 1988, STOC '88.
[6] Ronald Cramer,et al. A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.
[7] Matthew Green,et al. Blind Identity-Based Encryption and Simulatable Oblivious Transfer , 2007, ASIACRYPT.
[8] Xiaomin Liu,et al. Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection , 2009, TCC.
[9] Moni Naor,et al. Oblivious Transfer with Adaptive Queries , 1999, CRYPTO.
[10] Tatsuaki Okamoto,et al. Secure Integration of Asymmetric and Symmetric Encryption Schemes , 1999, Journal of Cryptology.
[11] Hovav Shacham,et al. A Cramer-Shoup Encryption Scheme from the Linear Assumption and from Progressively Weaker Linear Variants , 2007, IACR Cryptol. ePrint Arch..
[12] Jan Camenisch,et al. Group signature schemes and payment systems based on the discrete logarithm problem , 1998 .
[13] Bart Preneel,et al. Universally Composable Adaptive Priced Oblivious Transfer , 2009, Pairing.
[14] Markulf Kohlweiss,et al. Non-Interactive Anonymous Credentials , 2007, IACR Cryptol. ePrint Arch..
[15] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[16] Markulf Kohlweiss,et al. P-signatures and Noninteractive Anonymous Credentials , 2008, TCC.
[17] Vanessa Teague,et al. Selecting Correlated Random Actions , 2004, Financial Cryptography.
[18] Markus Jakobsson,et al. Security of Signed ElGamal Encryption , 2000, ASIACRYPT.
[19] A. Miyaji,et al. New Explicit Conditions of Elliptic Curve Traces for FR-Reduction , 2001 .
[20] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[21] Michael K. Reiter,et al. Alternatives to Non-malleability: Definitions, Constructions, and Applications (Extended Abstract) , 2004, TCC.
[22] Yuval Ishai,et al. Founding Cryptography on Oblivious Transfer - Efficiently , 2008, CRYPTO.
[23] Mihir Bellare,et al. Optimal Asymmetric Encryption , 1994, EUROCRYPT.
[24] Jan Camenisch,et al. Untraceable RFID tags via insubvertible encryption , 2005, CCS '05.
[25] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[26] Georg Fuchsbauer,et al. Automorphic Signatures in Bilinear Groups and an Application to Round-Optimal Blind Signatures , 2009, IACR Cryptol. ePrint Arch..
[27] Matthew Green,et al. Universally Composable Adaptive Oblivious Transfer , 2008, IACR Cryptol. ePrint Arch..
[28] Stefan Brands,et al. Rapid Demonstration of Linear Relations Connected by Boolean Operators , 1997, EUROCRYPT.
[29] Eike Kiltz,et al. Chosen-Ciphertext Security from Tag-Based Encryption , 2006, TCC.
[30] Matthew Green,et al. Practical Adaptive Oblivious Transfer from Simple Assumptions , 2011, IACR Cryptol. ePrint Arch..
[31] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[32] Kaoru Kurosawa,et al. Simple Adaptive Oblivious Transfer without Random Oracle , 2009, ASIACRYPT.
[33] Matthew Green,et al. Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials , 2009, Public Key Cryptography.
[34] Ivan Damgård,et al. Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols , 1994, CRYPTO.
[35] Jan Camenisch,et al. Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes , 1998, EUROCRYPT.
[36] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[37] Abhi Shelat,et al. Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.
[38] Jonathan Katz,et al. Improved Efficiency for CCA-Secure Cryptosystems Built Using Identity-Based Encryption , 2005, CT-RSA.
[39] Brent Waters,et al. Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys , 2006, EUROCRYPT.
[40] Abhi Shelat,et al. Securely Obfuscating Re-Encryption , 2007, Journal of Cryptology.
[41] Fabien Laguillaumie,et al. Universally Convertible Directed Signatures , 2005, ASIACRYPT.
[42] Jan Camenisch,et al. Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.
[43] R. Rivest,et al. Ad-Hoc-Group Signatures from Hijacked Keypairs , 2005 .
[44] David Pointcheval,et al. About the Security of MTI/C0 and MQV , 2006, SCN.
[45] Radia Perlman,et al. The ephemerizer: making data disappear , 2005 .
[46] Benoît Libert,et al. Multi-use unidirectional proxy re-signatures , 2008, CCS.
[47] Brent Waters,et al. Realizing Hash-and-Sign Signatures under Standard Assumptions , 2009, EUROCRYPT.
[48] Shai Halevi,et al. A Cryptographic Solution to a Game Theoretic Problem , 2000, CRYPTO.
[49] Jan Camenisch,et al. Efficient Group Signature Schemes for Large Groups (Extended Abstract) , 1997, CRYPTO.
[50] Mihir Bellare,et al. Optimal Asymmetric Encryption-How to Encrypt with RSA , 1995 .
[51] Jan Camenisch,et al. Oblivious transfer with access control , 2009, IACR Cryptol. ePrint Arch..
[52] Gilles Brassard,et al. All-or-Nothing Disclosure of Secrets , 1986, CRYPTO.
[53] Kouichi Sakurai,et al. Blind Decoding, Blind Undeniable Signatures, and Their Applications to Privacy Protection , 1996, Information Hiding.
[54] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.