A study of separations in cryptography: new results and new models
暂无分享,去创建一个
[1] Dennis Hofheinz,et al. Possibility and Impossibility Results for Selective Decommitments , 2011, Journal of Cryptology.
[2] Jonathan Katz,et al. Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions , 2011, TCC.
[3] Jonathan Katz,et al. Impossibility of Blind Signatures from One-Way Permutations , 2011, TCC.
[4] Takahiro Matsuda,et al. On Black-Box Separations among Injective One-Way Functions , 2011, TCC.
[5] Rafael Pass,et al. Towards Non-Black-Box Lower Bounds in Cryptography , 2011, TCC.
[6] Yehuda Lindell,et al. On the Black-Box Complexity of Optimally-Fair Coin Tossing , 2011, TCC.
[7] Arkady Yerukhimovich,et al. On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations , 2010, LATINCRYPT.
[8] Iftach Haitner,et al. A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.
[9] Adam O'Neill,et al. Adaptive Trapdoor Functions and Chosen-Ciphertext Security , 2010, EUROCRYPT.
[10] Marc Fischlin,et al. On the Impossibility of Three-Move Blind Signature Schemes , 2010, EUROCRYPT.
[11] Yevgeniy Vahlis,et al. Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs , 2010, TCC.
[12] Rafael Pass,et al. Private Coins versus Public Coins in Zero-Knowledge Proof Systems , 2010, TCC.
[13] Jonathan Katz,et al. On Black-Box Constructions of Predicate Encryption from Trapdoor Permutations , 2009, ASIACRYPT.
[14] David Cash,et al. Foundations of Non-malleable Hash and One-Way Functions , 2009, ASIACRYPT.
[15] Omer Reingold,et al. Inaccessible entropy , 2009, STOC '09.
[16] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[17] Thomas Holenstein,et al. On the (Im)Possibility of Key Dependent Encryption , 2009, TCC.
[18] Guy N. Rothblum,et al. Weak Verifiable Random Functions , 2009, TCC.
[19] Hoeteck Wee,et al. Black-Box Constructions of Two-Party Protocols from One-Way Functions , 2009, TCC.
[20] Gil Segev,et al. Chosen-Ciphertext Security via Correlated Products , 2009, SIAM J. Comput..
[21] Periklis A. Papakonstantinou,et al. On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[22] Satyanarayana V. Lokam,et al. Improved Bounds on Security Reductions for Discrete Log Based Signatures , 2008, Annual International Cryptology Conference.
[23] Jonathan Katz,et al. Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products , 2008, Journal of Cryptology.
[24] Emmanuel Bresson,et al. Separation Results on the "One-More" Computational Problems , 2008, CT-RSA.
[25] Jonathan Katz,et al. Which Languages Have 4-Round Zero-Knowledge Proofs? , 2008, Journal of Cryptology.
[26] Gil Segev,et al. A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval , 2008, TCC.
[27] Boaz Barak,et al. Merkle Puzzles are Optimal , 2008, IACR Cryptol. ePrint Arch..
[28] Boaz Barak,et al. Lower Bounds on Signatures From Symmetric Primitives , 2008, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[29] Abhi Shelat,et al. Bounded CCA2-Secure Encryption , 2007, ASIACRYPT.
[30] Rafail Ostrovsky,et al. Attribute-based encryption with non-monotonic access structures , 2007, CCS '07.
[31] Omer Reingold,et al. Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[32] Dominique Unruh,et al. Random Oracles and Auxiliary Input , 2007, CRYPTO.
[33] Yehuda Lindell,et al. Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series) , 2007 .
[34] Brent Waters,et al. Ciphertext-Policy Attribute-Based Encryption , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).
[35] Steven Myers,et al. Towards a Separation of Semantic and CCA Security for Public Key Encryption , 2007, TCC.
[36] Hoeteck Wee,et al. One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments , 2007, TCC.
[37] Brent Waters,et al. Conjunctive, Subset, and Range Queries on Encrypted Data , 2007, TCC.
[38] Jorge Luis Villar,et al. Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption , 2006, ASIACRYPT.
[39] Brent Waters,et al. Attribute-based encryption for fine-grained access control of encrypted data , 2006, CCS '06.
[40] Marc Fischlin,et al. Round-Optimal Composable Blind Signatures in the Common Reference String Model , 2006, CRYPTO.
[41] Abhi Shelat,et al. Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One , 2006, CRYPTO.
[42] Rafael Pass,et al. Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on NP-hardness , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).
[43] Pascal Paillier,et al. Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log , 2005, ASIACRYPT.
[44] Rafael Pass,et al. Concurrent non-malleable commitments , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[45] Yevgeniy Dodis,et al. On the Generic Insecurity of the Full Domain Hash , 2005, CRYPTO.
[46] Yuval Ishai,et al. COMPUTATIONALLY PRIVATE RANDOMIZING POLYNOMIALS AND THEIR APPLICATIONS , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[47] Dan Boneh,et al. Hierarchical Identity Based Encryption with Constant Size Ciphertext , 2005, EUROCRYPT.
[48] Brent Waters,et al. Fuzzy Identity-Based Encryption , 2005, EUROCRYPT.
[49] Leonid Reyzin,et al. Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins? , 2004, CRYPTO.
[50] N. V. Vinodchandran,et al. Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..
[51] Rafael Pass,et al. Bounded-concurrent secure multi-party computation with a dishonest majority , 2004, STOC '04.
[52] Luca Trevisan,et al. Notions of Reducibility between Cryptographic Primitives , 2004, TCC.
[53] Alon Rosen,et al. A Note on Constant-Round Zero-Knowledge Proofs for NP , 2004, TCC.
[54] Rafael Pass,et al. Bounded-concurrent secure two-party computation in a constant number of rounds , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[55] Yehuda Lindell,et al. Lower bounds for non-black-box zero knowledge , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[56] Jonathan Katz,et al. Lower bounds on the efficiency of encryption and digital signature schemes , 2003, STOC '03.
[57] Yehuda Lindell,et al. Bounded-concurrent secure two-party computation without setup assumptions , 2003, STOC '03.
[58] Ran Canetti,et al. A Forward-Secure Public-Key Encryption Scheme , 2003, Journal of Cryptology.
[59] Yehuda Lindell,et al. A Simpler Construction of CCA2-Secure Public-Key Encryption under General Assumptions , 2003, Journal of Cryptology.
[60] Rafail Ostrovsky,et al. Round Efficiency of Multi-party Computation with a Dishonest Majority , 2003, EUROCRYPT.
[61] Boaz Barak,et al. Constant-round coin-tossing with a man in the middle or realizing the shared random string model , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[62] Yevgeniy Dodis,et al. On the Power of Claw-Free Permutations , 2002, SCN.
[63] Yehuda Lindell,et al. Strict polynomial-time in simulation and extraction , 2002, STOC '02.
[64] Jean-Sébastien Coron,et al. Optimal Security Proofs for PSS and Other Signature Schemes , 2002, EUROCRYPT.
[65] Marc Fischlin,et al. On the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function , 2002, CT-RSA.
[66] Boaz Barak,et al. How to go beyond the black-box simulation barrier , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[67] Tal Malkin,et al. On the impossibility of basing trapdoor functions on trapdoor predicates , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[68] Matthew K. Franklin,et al. Identity-Based Encryption from the Weil Pairing , 2001, CRYPTO.
[69] Luca Trevisan,et al. Lower bounds on the efficiency of generic cryptographic constructions , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[70] Sampath Kannan,et al. The relationship between public key encryption and oblivious transfer , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[71] Michael E. Saks,et al. A dual version of Reimer's inequality and a proof of Rudich's conjecture , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[72] Moni Naor,et al. Nonmalleable Cryptography , 2000, SIAM Rev..
[73] Daniel R. Simon,et al. Limits on the efficiency of one-way permutation-based hash functions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[74] Amit Sahai,et al. Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[75] Adi Shamir,et al. Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions , 1999, SIAM J. Comput..
[76] Leonid A. Levin,et al. A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..
[77] Toshiaki Tanaka,et al. On the Existence of 3-Round Zero-Knowledge Protocols , 1998, CRYPTO.
[78] Daniel R. Simon,et al. Finding Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? , 1998, EUROCRYPT.
[79] Dan Boneh,et al. Breaking RSA May Not Be Equivalent to Factoring , 1998, EUROCRYPT.
[80] Markus Jakobsson,et al. Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function , 1997, EUROCRYPT.
[81] Donald Beaver,et al. Correlated pseudorandomness and the complexity of private computations , 1996, STOC '96.
[82] Oded Goldreich,et al. How to construct constant-round zero-knowledge proof systems for NP , 1996, Journal of Cryptology.
[83] Oded Goldreich,et al. Definitions and properties of zero-knowledge proof systems , 1994, Journal of Cryptology.
[84] M. Bellare,et al. Random oracles are practical: a paradigm for designing efficient protocols , 1993, CCS '93.
[85] Dalit Naor,et al. Broadcast Encryption , 1993, Encyclopedia of Multimedia.
[86] Rafail Ostrovsky,et al. One-way functions are essential for non-trivial zero-knowledge , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[87] Steven Rudich,et al. The Use of Interaction in Public Cryptosystems (Extended Abstract) , 1991, CRYPTO.
[88] Silvio Micali,et al. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.
[89] Johan Håstad,et al. Statistical Zero-Knowledge Languages can be Recognized in Two Rounds , 1991, J. Comput. Syst. Sci..
[90] Adi Shamir,et al. Multiple non-interactive zero knowledge proofs based on a single random string , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[91] Carsten Lund,et al. Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[92] Hugo Krawczyk,et al. On the Composition of Zero-Knowledge Proof Systems , 1990, ICALP.
[93] Moni Naor,et al. Public-key cryptosystems provably secure against chosen ciphertext attacks , 1990, STOC '90.
[94] Rafail Ostrovsky,et al. Perfect zero-knowledge in constant rounds , 1990, STOC '90.
[95] John Rompel,et al. One-way functions are necessary and sufficient for secure signatures , 1990, STOC '90.
[96] Moni Naor,et al. Bit commitment using pseudorandomness , 1989, Journal of Cryptology.
[97] Mihir Bellare,et al. New Paradigms for Digital Signatures and Message Authentication Based on Non-Interative Zero Knowledge Proofs , 1989, CRYPTO.
[98] Adi Shamir,et al. Zero Knowledge Proofs of Knowledge in Two Rounds , 1989, CRYPTO.
[99] Moti Yung,et al. Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract) , 1989, EUROCRYPT.
[100] S. Micali,et al. The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..
[101] Moni Naor,et al. Universal one-way hash functions and their cryptographic applications , 1989, STOC '89.
[102] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[103] Russell Impagliazzo,et al. Limits on the provable consequences of one-way permutations , 1988, STOC '89.
[104] Amos Fiat,et al. Zero-knowledge proofs of identity , 1987, Journal of Cryptology.
[105] Shafi Goldwasser,et al. Private coins versus public coins in interactive proof systems , 1986, STOC '86.
[106] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.
[107] Silvio Micali,et al. How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design , 1986, CRYPTO.
[108] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[109] L. Babai,et al. Trading group theory for randomness , 1985, STOC '85.
[110] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[111] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[112] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[113] Bill Broyles. Bibliography , 1898, The Journal of Laryngology, Rhinology, and Otology.
[114] Manuel Blum,et al. How to Prove a Theorem So No One Else Can Claim It , 2010 .
[115] Periklis A. Papakonstantinou. Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity , 2010 .
[116] Daniel R. L. Brown,et al. Irreducibility to the One-More Evaluation Problems: More May Be Less , 2007, IACR Cryptol. ePrint Arch..
[117] Chi-Jen Lu,et al. The Impossibility of Basing One-Way Permutations on Central Cryptographic Primitives , 2005, Journal of Cryptology.
[118] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[119] Lance Fortnow,et al. The Complexity of Perfect Zero-Knowledge (Extended Abstract) , 1987, STOC 1987.
[120] Stephen M. Rudich,et al. Limits on the provable consequences of one-way functions , 1983, STOC 1983.
[121] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..