Search results for "average-case hardness"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran	Some Results on Average-Case Hardness Within the Polynomial Hierarchy.	FSTTCS	2006	DBLP DOI BibTeX RDF
1	Noam Livne	On the Construction of One-Way Functions from Average Case Hardness.	ICS	2010	DBLP BibTeX RDF
1	Noam Livne	On the Construction of One-Way Functions from Average Case Hardness.	Electronic Colloquium on Computational Complexity (ECCC)	2009	DBLP BibTeX RDF
1	Oded Regev	On lattices, learning with errors, random linear codes, and cryptography.	J. ACM	2009	DBLP DOI BibTeX RDF	average-case hardness, cryptography, quantum computation, Lattice, public key encryption
1	Parikshit Gopalan, Venkatesan Guruswami	Hardness Amplification within NP against Deterministic Algorithms.	IEEE Conference on Computational Complexity	2008	DBLP DOI BibTeX RDF	Hardness Amplication, Error-Correcting Codes, Derandomization, NP
1	Luca Trevisan	Average-case Complexity.	FOCS	2008	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification via Space-Efficient Direct Products.	Computational Complexity	2008	DBLP DOI BibTeX RDF	94B35, 68Q25, 94B05, 68P30, Subject classification. 68Q17
1	Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu	Impossibility Results on Weakly Black-Box Hardness Amplification.	FCT	2007	DBLP DOI BibTeX RDF
1	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity Via Uniform Reductions.	Computational Complexity	2007	DBLP DOI BibTeX RDF	Subject classification, 68Q10
1	Albert Atserias	Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries.	IEEE Conference on Computational Complexity	2006	DBLP DOI BibTeX RDF
1	Venkatesan Guruswami, Valentine Kabanets	Hardness Amplification Via Space-Efficient Direct Products.	LATIN	2006	DBLP DOI BibTeX RDF	error-correcting codes, expanders, Direct products, hardness amplification
1	Emanuele Viola	Pseudorandom Bits for Constant Depth Circuits with Few Arbitrary Symmetric Gates.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
1	Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami	Computational Indistinguishability Between Quantum States and Its Cryptographic Application.	EUROCRYPT	2005	DBLP DOI BibTeX RDF
1	Oded Regev	New lattice-based cryptographic constructions.	J. ACM	2004	DBLP DOI BibTeX RDF	average-case hardness, cryptography, quantum computing, Lattice, public key encryption
1	Cynthia Dwork, Ronen Shaltiel, Adam Smith, Luca Trevisan	List-Decoding of Linear Functions and Analysis of a Two-Round Zero-Knowledge Argument.	TCC	2004	DBLP DOI BibTeX RDF
1	Oded Regev	New lattice based cryptographic constructions.	STOC	2003	DBLP DOI BibTeX RDF	average-case hardness, cryptography, quantum computing, lattices, public key encryption
1	Michael Alekhnovich	More on Average Case vs Approximation Complexity.	FOCS	2003	DBLP DOI BibTeX RDF
1	Andrej Bogdanov, Luca Trevisan	On Worst-Case to Average-Case Reductions for NP Problems.	FOCS	2003	DBLP DOI BibTeX RDF
1	Luca Trevisan, Salil P. Vadhan	Pseudorandomness and Average-Case Complexity via Uniform Reductions. (PDF / PS)	IEEE Conference on Computational Complexity	2002	DBLP DOI BibTeX RDF
1	Jin-yi Cai	On the Average-Case Hardness of CVP.	FOCS	2001	DBLP DOI BibTeX RDF
1	Madhu Sudan, Luca Trevisan, Salil P. Vadhan	Pseudorandom Generators without the XOR Lemma (Abstract). (PDF / PS)	IEEE Conference on Computational Complexity	1999	DBLP DOI BibTeX RDF	polynomial reconstruct ion, Pseudorandom generators, extractors, list-decoding
1	Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim	Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs.	ICALP	1997	DBLP DOI BibTeX RDF
1	Cynthia Dwork	Positive Applications of Lattices to Cryptography.	MFCS	1997	DBLP DOI BibTeX RDF