Dual Form Signatures: An Approach for Proving Security from Static Assumptions
暂无分享,去创建一个
Allison Bishop | Brent Waters | Adam O'Neill | Michael Gerbush | Brent Waters | Adam O'Neill | Allison Bishop | Michael Gerbush
[1] Jan Camenisch,et al. Compact E-Cash , 2005, EUROCRYPT.
[2] Moni Naor,et al. Public-Key Cryptosystems Resilient to Key Leakage , 2012, SIAM J. Comput..
[3] Moni Naor,et al. An Efficient Existentially Unforgeable Signature Scheme and its Applications , 1994, CRYPTO.
[4] Silvio Micali,et al. How to sign given any trapdoor function , 1988, STOC '88.
[5] Tatsuaki Okamoto,et al. Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes , 1992, CRYPTO.
[6] Rafail Ostrovsky,et al. Non-interactive Zaps and New Techniques for NIZK , 2006, CRYPTO.
[7] Xavier Boyen,et al. Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More , 2010, Public Key Cryptography.
[8] Claus-Peter Schnorr,et al. Efficient signature generation by smart cards , 2004, Journal of Cryptology.
[9] Ronald Cramer,et al. Signature schemes based on the strong RSA assumption , 2000, TSEC.
[10] Mihir Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[11] Silvio Micali,et al. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks , 1988, SIAM J. Comput..
[12] Dan Boneh,et al. Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.
[13] Allison Bishop,et al. New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts , 2010, IACR Cryptol. ePrint Arch..
[14] Amit Sahai,et al. Efficient Non-interactive Proof Systems for Bilinear Groups , 2008, EUROCRYPT.
[15] Hovav Shacham,et al. Sequential Aggregate Signatures from Trapdoor Permutations , 2004, EUROCRYPT.
[16] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[17] Jan Camenisch,et al. Untraceable RFID tags via insubvertible encryption , 2005, CCS '05.
[18] Hovav Shacham,et al. Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.
[19] Jan Camenisch,et al. How to win the clonewars: efficient periodic n-times anonymous authentication , 2006, CCS '06.
[20] Craig Gentry,et al. Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing , 2007, CCS '07.
[21] Vinod Vaikuntanathan,et al. Signature Schemes with Bounded Leakage Resilience , 2009, ASIACRYPT.
[22] Ivan Damgård,et al. New Generation of Secure and Practical RSA-Based Signatures , 1996, CRYPTO.
[23] Moni Naor,et al. An Efficient Existentially Unforgeable Signature Scheme and Its Applications , 1994, Journal of Cryptology.
[24] Brent Waters,et al. Identity-Based Encryption Secure against Selective Opening Attack , 2011, TCC.
[25] Georg Fuchsbauer,et al. Structure-Preserving Signatures and Commitments to Group Elements , 2010, CRYPTO.
[26] Rafail Ostrovsky,et al. Sequential Aggregate Signatures and Multisignatures Without Random Oracles , 2006, EUROCRYPT.
[27] Brent Waters,et al. Realizing Hash-and-Sign Signatures under Standard Assumptions , 2009, EUROCRYPT.
[28] Manoj Prabhakaran,et al. Attribute-Based Signatures , 2011, CT-RSA.
[29] Jan Camenisch,et al. Signature Schemes and Anonymous Credentials from Bilinear Maps , 2004, CRYPTO.
[30] Jan Camenisch,et al. A Cryptographic Framework for the Controlled Release of Certified Data , 2004, Security Protocols Workshop.
[31] Vincenzo Iovino,et al. Hidden-Vector Encryption with Groups of Prime Order , 2008, Pairing.
[32] Abhi Shelat,et al. Computing on Authenticated Data , 2012, Journal of Cryptology.
[33] Ran Canetti,et al. A Forward-Secure Public-Key Encryption Scheme , 2003, Journal of Cryptology.
[34] Jean-Sébastien Coron,et al. On the Exact Security of Full Domain Hash , 2000, CRYPTO.
[35] Abhi Shelat,et al. Simulatable Adaptive Oblivious Transfer , 2007, EUROCRYPT.
[36] Amit Sahai,et al. Pseudonym Systems , 1999, Selected Areas in Cryptography.
[37] Jan Camenisch,et al. Batch Verification of Short Signatures , 2007, Journal of Cryptology.
[38] Gregory Neven,et al. Efficient Sequential Aggregate Signed Data , 2008, IEEE Transactions on Information Theory.
[39] Allison Bishop,et al. Decentralizing Attribute-Based Encryption , 2011, IACR Cryptol. ePrint Arch..
[40] Jan Camenisch,et al. Efficient Blind Signatures Without Random Oracles , 2004, SCN.
[41] Shai Halevi,et al. Secure Hash-and-Sign Signatures Without the Random Oracle , 1999, EUROCRYPT.
[42] Rafail Ostrovsky,et al. Perfect Non-Interactive Zero Knowledge for NP , 2006, IACR Cryptol. ePrint Arch..
[43] Allison Bishop,et al. Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting , 2012, EUROCRYPT.
[44] Brent Waters,et al. Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.
[45] Tatsuaki Okamoto,et al. Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption , 2010, IACR Cryptol. ePrint Arch..
[46] Brent Waters,et al. Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys , 2006, EUROCRYPT.
[47] Brent Waters,et al. Short and Stateless Signatures from the RSA Assumption , 2009, CRYPTO.
[48] Brent Waters,et al. Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions , 2009, IACR Cryptol. ePrint Arch..
[49] Brent Waters,et al. Building efficient fully collusion-resilient traitor tracing and revocation schemes , 2010, CCS '10.
[50] David Cash,et al. Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.
[51] Dan Boneh,et al. Short Signatures Without Random Oracles , 2004, EUROCRYPT.
[52] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[53] Dong Hoon Lee,et al. Universal forgery of the identity-based sequential aggregate signature scheme , 2009, ASIACCS '09.
[54] Jan Camenisch,et al. Practical Group Signatures without Random Oracles , 2005, IACR Cryptol. ePrint Arch..
[55] Moni Naor,et al. Public-Key Encryption in the Bounded-Retrieval Model , 2010, EUROCRYPT.
[56] Mihir Bellare,et al. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.
[57] Jonathan Katz,et al. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products , 2008, Journal of Cryptology.
[58] Dan Boneh,et al. Secure Identity Based Encryption Without Random Oracles , 2004, CRYPTO.
[59] Allison Bishop,et al. Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption , 2010, EUROCRYPT.
[60] Hovav Shacham,et al. Short Signatures from the Weil Pairing , 2001, J. Cryptol..
[61] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[62] Jacques Stern,et al. Security Proofs for Signature Schemes , 1996, EUROCRYPT.
[63] Elaine Shi,et al. Multi-Dimensional Range Query over Encrypted Data , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).
[64] Brent Waters,et al. Efficient Identity-Based Encryption Without Random Oracles , 2005, EUROCRYPT.
[65] Matthew Green,et al. Synchronized aggregate signatures: new definitions, constructions and applications , 2010, CCS '10.
[66] Dan Boneh,et al. Efficient Selective-ID Secure Identity Based Encryption Without Random Oracles , 2004, IACR Cryptol. ePrint Arch..
[67] Craig Gentry,et al. Identity-Based Aggregate Signatures , 2006, Public Key Cryptography.
[68] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[69] Georg Fuchsbauer,et al. Structure-Preserving Signatures and Commitments to Group Elements , 2010, Journal of Cryptology.
[70] David Mandell Freeman,et al. Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups , 2010, EUROCRYPT.
[71] Ivan Damgård,et al. Secure Signature Schemes Based on Interactive Protocols See Back Inner Page for a List of Recent Publications in the Brics Report Series. Copies May Be Obtained by Contacting: Secure Signature Schemes Based on Interactive Protocols , 1995 .
[72] Matthew Green,et al. Blind Identity-Based Encryption and Simulatable Oblivious Transfer , 2007, ASIACRYPT.
[73] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[74] Abhi Shelat,et al. Computing on Authenticated Data , 2012, TCC.
[75] Jan Camenisch,et al. Anonymous yet accountable access control , 2005, WPES '05.