Amnon Ta-Shma

Avraham Ben-Aroya, Amnon Ta-Shma: Constructing Small-Bias Sets from Algebraic-Geometric Codes. Theory of Computing 9: 253-272 (2013)

Avraham Ben-Aroya, Amnon Ta-Shma: Better short-seed quantum-proof extractors. Theor. Comput. Sci. 419: 17-25 (2012)

Amnon Ta-Shma, Christopher Umans: Better Condensers and New Extractors from Parvaresh-Vardy Codes. IEEE Conference on Computational Complexity 2012: 309-315

Jonathan Ben-Nun, Niko Fahri, Morgan Llewellyn, Ben Riva, Alon Rosen, Amnon Ta-Shma, Douglas Wikström: A New Implementation of a Dual (Paper and Cryptographic) Voting System. Electronic Voting 2012: 315-329

Rotem Arnon Friedman, Esther Hänggi, Amnon Ta-Shma: Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints. CoRR abs/1205.3736 (2012)

Rotem Arnon Friedman, Amnon Ta-Shma: On the limits of privacy amplification against non-signalling memory attacks. CoRR abs/1211.1125 (2012)

Avraham Ben-Aroya, Amnon Ta-Shma: A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product. SIAM J. Comput. 40(2): 267-290 (2011)

Amnon Ta-Shma: Short Seed Extractors against Quantum Storage. SIAM J. Comput. 40(3): 664-677 (2011)

Avraham Ben-Aroya, Amnon Ta-Shma: Approximate Quantum Error Correction for Correlated Noise. IEEE Transactions on Information Theory 57(6): 3982-3988 (2011)

Avraham Ben-Aroya, Amnon Ta-Shma: On the complexity of approximating the diamond norm. Quantum Information & Computation 10(1&2): 77-86 (2010)

Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma: Quantum Expanders: Motivation and Construction. Theory of Computing 6(1): 47-79 (2010)

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: Local List Decoding with a Constant Number of Queries. FOCS 2010: 715-722

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: Local list decoding with a constant number of queries. Electronic Colloquium on Computational Complexity (ECCC) 17: 47 (2010)

Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma: A Note on Amplifying the Error-Tolerance of Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 17: 134 (2010)

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded-Storage Model. J. Cryptology 22(2): 189-226 (2009)

Avraham Ben-Aroya, Amnon Ta-Shma: Constructing Small-Bias Sets from Algebraic-Geometric Codes. FOCS 2009: 191-197

Amnon Ta-Shma: Short seed extractors against quantum storage. STOC 2009: 401-408

Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma: Quantum Expanders: Motivation and Constructions. IEEE Conference on Computational Complexity 2008: 292-303

Avraham Ben-Aroya, Amnon Ta-Shma: A combinatorial construction of almost-ramanujan graphs using the zig-zag product. STOC 2008: 325-334

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. Computational Complexity 16(4): 412-441 (2007)

Amnon Ta-Shma, Christopher Umans, David Zuckerman: Lossless Condensers, Unbalanced Expanders, And Extractors. Combinatorica 27(2): 213-240 (2007)

Dorit Aharonov, Amnon Ta-Shma: Adiabatic Quantum State Generation. SIAM J. Comput. 37(1): 47-82 (2007)

Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication. IEEE Transactions on Information Theory 53(6): 1970-1982 (2007)

Ishay Haviv, Oded Regev, Amnon Ta-Shma: On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy. Theory of Computing 3(1): 45-60 (2007)

Dan Gutfreund, Amnon Ta-Shma: Worst-Case to Average-Case Reductions Revisited. APPROX-RANDOM 2007: 569-583

Amnon Ta-Shma, Uri Zwick: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. SODA 2007: 599-608

Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller codes. J. Comput. Syst. Sci. 72(5): 786-812 (2006)

Eran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in Expander-Based Code Constructions. IEEE Transactions on Information Theory 52(8): 3695-3700 (2006)

Amnon Ta-Shma, Christopher Umans: Better lossless condensers through derandomized curve samplers. FOCS 2006: 177-186

Dan Gutfreund, Amnon Ta-Shma: New connections between derandomization, worst-case complexity and average-case complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(108) (2006)

Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. APPROX-RANDOM 2005: 294-305

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: If NP Languages are Hard on the Worst-Case Then It is Easy to Find Their Hard Instances. IEEE Conference on Computational Complexity 2005: 243-257

Eran Rom, Amnon Ta-Shma: Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes. STACS 2005: 557-568

Ronen Gradwohl, Guy Kindler, Omer Reingold, Amnon Ta-Shma: On the Error Parameter of Dispersers. Electronic Colloquium on Computational Complexity (ECCC)(061) (2005)

Amnon Ta-Shma, David Zuckerman: Extractor codes. IEEE Transactions on Information Theory 50(12): 3015-3025 (2004)

Tal Moran, Ronen Shaltiel, Amnon Ta-Shma: Non-interactive Timestamping in the Bounded Storage Model. CRYPTO 2004: 460-476

Ron Berman, Amos Fiat, Amnon Ta-Shma: Provable Unlinkability against Traffic Analysis. Financial Cryptography 2004: 266-280

Eran Rom, Amnon Ta-Shma: Improveing the alphabet size in high noise, almost optimal rate list decodable codes. Electronic Colloquium on Computational Complexity (ECCC)(069) (2004)

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. Computational Complexity 12(3-4): 85-130 (2003)

Sean Hallgren, Alexander Russell, Amnon Ta-Shma: The Hidden Subgroup Problem and Quantum Computation Using Group Representations. SIAM J. Comput. 32(4): 916-934 (2003)

Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. SIAM J. Comput. 32(6): 1570-1585 (2003)

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma: Uniform hardness vs. randomness tradeoffs for Arthur-Merlin games. IEEE Conference on Computational Complexity 2003: 33-47

Dorit Aharonov, Amnon Ta-Shma: Adiabatic quantum state generation and statistical zero knowledge. STOC 2003: 20-29

Amnon Ta-Shma: Almost Optimal Dispersers. Combinatorica 22(1): 123-145 (2002)

Amnon Ta-Shma: Storing information with extractors. Inf. Process. Lett. 83(5): 267-274 (2002)

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense quantum coding and quantum finite automata. J. ACM 49(4): 496-511 (2002)

Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller Codes. FOCS 2001: 638-647

Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in quantum communication and the complexity of set disjointness. STOC 2001: 124-133

Amnon Ta-Shma, Christopher Umans, David Zuckerman: Loss-less condensers, unbalanced expanders, and extractors. STOC 2001: 143-152

Amnon Ta-Shma, David Zuckerman: Extractor codes. STOC 2001: 193-199

Amnon Ta-Shma, David Zuckerman, Shmuel Safra: Extractors from Reed-Muller Codes. Electronic Colloquium on Computational Complexity (ECCC) 8(36) (2001)

Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou: An O(log(n)^4/3) space algorithm for (s, t) connectivity in undirected graphs. J. ACM 47(2): 294-311 (2000)

Jaikumar Radhakrishnan, Amnon Ta-Shma: Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators. SIAM J. Discrete Math. 13(1): 2-24 (2000)

Tomas Sander, Amnon Ta-Shma, Moti Yung: Blind, Auditable Membership Proofs. Financial Cryptography 2000: 53-71

Sean Hallgren, Alexander Russell, Amnon Ta-Shma: Normal subgroup reconstruction and quantum computation using group representations. STOC 2000: 627-635

Dorit Aharonov, Amnon Ta-Shma, Umesh V. Vazirani, Andrew Chi-Chih Yao: Quantum bit escrow. STOC 2000: 705-714

Ashwin Nayak, Amnon Ta-Shma, David Zuckerman: Interaction in Quantum Communication Complexity. CoRR quant-ph/0005106 (2000)

Noam Nisan, Amnon Ta-Shma: Extracting Randomness: A Survey and New Constructions. J. Comput. Syst. Sci. 58(1): 148-173 (1999)

Amnon Ta-Shma: Classical versus quantum communication complexity. SIGACT News 30(3): 25-34 (1999)

Tomas Sander, Amnon Ta-Shma: Auditable, Anonymous Electronic Cash Extended Abstract. CRYPTO 1999: 555-572

Tomas Sander, Amnon Ta-Shma: Flow Control: A New Approach for Anonymity Control in Electronic Cash Systems. Financial Cryptography 1999: 46-61

Tomas Sander, Amnon Ta-Shma: On Anonymous Electronic Cash and Crime. ISW 1999: 202-206

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata. STOC 1999: 376-383

Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson: The Quantum Communication Complexity of Sampling. FOCS 1998: 342-351

Amnon Ta-Shma: Almost Optimal Dispersers. STOC 1998: 196-202

Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani: Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata. CoRR quant-ph/9804043 (1998)

Jaikumar Radhakrishnan, Amnon Ta-Shma: Tight Bounds for Depth-two Superconcentrators. FOCS 1997: 585-594

Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou: SL <= L^4/3. STOC 1997: 230-239

Amnon Ta-Shma: A Note on PCP vs. MIP. Inf. Process. Lett. 58(3): 135-140 (1996)

Amnon Ta-Shma: On Extracting Randomness From Weak Random Sources (Extended Abstract). STOC 1996: 276-285

Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Chicago J. Theor. Comput. Sci. 1995 (1995)

Noam Nisan, Amnon Ta-Shma: Symmetric logspace is closed under complement. STOC 1995: 140-146

Amnon Ta-Shma: On Extracting Randomness From Weak Random Sources. Electronic Colloquium on Computational Complexity (ECCC) 2(58) (1995)

Noam Nisan, Amnon Ta-Shma: Symmetric Logspace is Closed Under Complement. Electronic Colloquium on Computational Complexity (ECCC) 1(3) (1994)