Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAlon Rosen
Person information
- affiliation: Harvard University, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c54]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27- [c53]Siyao Guo, Pritish Kamath, Alon Rosen, Katerina Sotiraki:
Limits on the Efficiency of (Ring) LWE Based Non-interactive Key Exchange. Public Key Cryptography (1) 2020: 374-395 - [i54]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. 27: 44 (2020) - [i53]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020) - [i52]Alon Rosen:
Fine-Grained Cryptography: A New Frontier? IACR Cryptol. ePrint Arch. 2020: 442 (2020)
2010 – 2019
- 2019
- [c52]Arka Rai Choudhuri
, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019: 1103-1114 - [e2]Dennis Hofheinz, Alon Rosen:
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11891, Springer 2019, ISBN 978-3-030-36029-0 [contents] - [e1]Dennis Hofheinz, Alon Rosen:
Theory of Cryptography - 17th International Conference, TCC 2019, Nuremberg, Germany, December 1-5, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11892, Springer 2019, ISBN 978-3-030-36032-0 [contents] - [i51]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. 26: 74 (2019) - [i50]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 549 (2019) - [i49]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019: 667 (2019) - 2018
- [c51]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work From Worst-Case Assumptions. CRYPTO (1) 2018: 789-819 - [c50]Pavel Hubácek, Alon Rosen, Margarita Vald:
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. EUROCRYPT (3) 2018: 66-87 - [c49]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. SCN 2018: 274-291 - [i48]Pavel Hubácek, Alon Rosen, Margarita Vald:
An Efficiency-Preserving Transformation from Honest-Verifier Statistical Zero-Knowledge to Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2018: 164 (2018) - [i47]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work from Worst-Case Assumptions. IACR Cryptol. ePrint Arch. 2018: 559 (2018) - 2017
- [c48]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-case fine-grained hardness. STOC 2017: 483-496 - [c47]Shweta Agrawal, Alon Rosen:
Functional Encryption for Bounded Collusions, Revisited. TCC (1) 2017: 173-205 - [c46]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) 2017: 747-776 - [p1]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. Tutorials on the Foundations of Cryptography 2017: 79-158 - [i46]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. Electron. Colloquium Comput. Complex. 24: 39 (2017) - [i45]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. Electron. Colloquium Comput. Complex. 24: 113 (2017) - [i44]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. IACR Cryptol. ePrint Arch. 2017: 202 (2017) - [i43]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Useful Work. IACR Cryptol. ePrint Arch. 2017: 203 (2017) - [i42]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. IACR Cryptol. ePrint Arch. 2017: 544 (2017) - [i41]Andrej Bogdanov, Alon Rosen:
Pseudorandom Functions: Three Decades Later. IACR Cryptol. ePrint Arch. 2017: 652 (2017) - 2016
- [j13]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. J. Cryptol. 29(3): 577-596 (2016) - [j12]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. SIAM J. Comput. 45(5): 1910-1952 (2016) - [c45]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. TCC (A1) 2016: 209-224 - [c44]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. TCC (A2) 2016: 319-351 - [c43]Brett Hemenway, Rafail Ostrovsky, Silas Richelson, Alon Rosen:
Adaptive Security with Quasi-Optimal Rate. TCC (A1) 2016: 525-541 - [i40]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electron. Colloquium Comput. Complex. 23: 59 (2016) - [i39]Gilad Asharov, Alon Rosen, Gil Segev:
Indistinguishability Obfuscation Does Not Reduce to Structured Languages. Electron. Colloquium Comput. Complex. 23: 92 (2016) - [i38]Shweta Agrawal, Alon Rosen:
Online-Offline Functional Encryption for Bounded Collusions. IACR Cryptol. ePrint Arch. 2016: 361 (2016) - [i37]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptol. ePrint Arch. 2016: 375 (2016) - 2015
- [c42]Hai Brenner, Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
Fast Non-Malleable Commitments. ACM Conference on Computer and Communications Security 2015: 1048-1057 - [c41]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. FOCS 2015: 1480-1498 - [c40]Siyao Guo, Tal Malkin, Igor Carboni Oliveira, Alon Rosen:
The Power of Negations in Cryptography. TCC (1) 2015: 36-65 - [c39]Giulia Alberini, Tal Moran, Alon Rosen:
Public Verification of Private Effort. TCC (2) 2015: 169-198 - [c38]Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing Encryption from Φ-hiding. TCC (1) 2015: 591-608 - [i36]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. Electron. Colloquium Comput. Complex. 22: 1 (2015) - [i35]Igor Carboni Oliveira, Siyao Guo, Tal Malkin, Alon Rosen:
The Power of Negations in Cryptography. Electron. Colloquium Comput. Complex. 22: 8 (2015) - [i34]Brett Hemenway, Rafail Ostrovsky, Alon Rosen:
Non-committing encryption from Φ-hiding. IACR Cryptol. ePrint Arch. 2015: 54 (2015) - [i33]Andrej Bogdanov, Siyao Guo, Daniel Masny, Silas Richelson, Alon Rosen:
On the Hardness of Learning with Rounding over Small Modulus. IACR Cryptol. ePrint Arch. 2015: 769 (2015) - [i32]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational Sumchecks. IACR Cryptol. ePrint Arch. 2015: 1058 (2015) - 2014
- [c37]Hai Brenner, Lubos Gaspar, Gaëtan Leurent, Alon Rosen, François-Xavier Standaert:
FPGA Implementations of SPRING - And Their Countermeasures against Side-Channel Attacks. CHES 2014: 414-432 - [c36]Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) 2014: 71-89 - [c35]Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
An Algebraic Approach to Non-malleability. FOCS 2014: 41-50 - [c34]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [c33]Abhishek Banerjee, Hai Brenner, Gaëtan Leurent, Chris Peikert, Alon Rosen:
SPRING: Fast Pseudorandom Functions from Rounded Ring Products. FSE 2014: 38-57 - [c32]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. ITCS 2014: 251-260 - [c31]Siyao Guo, Pavel Hubácek, Alon Rosen, Margarita Vald:
Rational arguments: single round delegation with sublinear verification. ITCS 2014: 523-540 - [c30]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the existence of extractable one-way functions. STOC 2014: 505-514 - [c29]Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. TCC 2014: 663-687 - [i31]Adi Akavia, Andrej Bogdanov, Siyao Guo, Akshay Kamath, Alon Rosen:
Candidate weak pseudorandom functions in AC0 ○ MOD2. Electron. Colloquium Comput. Complex. 21: 33 (2014) - [i30]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i29]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
On the Existence of Extractable One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 402 (2014) - [i28]Vipul Goyal, Silas Richelson, Alon Rosen, Margarita Vald:
An Algebraic Approach to Non-Malleability. IACR Cryptol. ePrint Arch. 2014: 586 (2014) - [i27]Siyao Guo, Tal Malkin, Igor Carboni Oliveira, Alon Rosen:
The Power of Negations in Cryptography. IACR Cryptol. ePrint Arch. 2014: 902 (2014) - [i26]Giulia Alberini, Tal Moran, Alon Rosen:
Public Verification of Private Effort. IACR Cryptol. ePrint Arch. 2014: 983 (2014) - [i25]Nir Bitansky, Omer Paneth, Alon Rosen:
On the Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2014: 1029 (2014) - 2013
- [j11]Rafael Pass, Alon Rosen, Wei-Lung Dustin Tseng:
Public-Coin Parallel Zero-Knowledge for NP. J. Cryptol. 26(1): 1-10 (2013) - [j10]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptol. 26(1): 39-74 (2013) - [j9]Andrej Bogdanov, Alon Rosen:
Input Locality and Hardness Amplification. J. Cryptol. 26(1): 144-171 (2013) - [j8]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential rationality in cryptographic protocols. ACM Trans. Economics and Comput. 1(1): 2:1-2:38 (2013) - [c28]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. CRYPTO (1) 2013: 277-297 - [i24]Pavel Hubácek, Jesper Buus Nielsen, Alon Rosen:
Limits on the Power of Cryptographic Cheap Talk. IACR Cryptol. ePrint Arch. 2013: 499 (2013) - [i23]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
Indistinguishability Obfuscation vs. Auxiliary-Input Extractable Functions: One Must Fall. IACR Cryptol. ePrint Arch. 2013: 641 (2013) - [i22]Tal Moran, Alon Rosen:
There is no Indistinguishability Obfuscation in Pessiland. IACR Cryptol. ePrint Arch. 2013: 643 (2013) - [i21]Nir Bitansky, Ran Canetti, Omer Paneth, Alon Rosen:
More on the Impossibility of Virtual-Black-Box Obfuscation with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 701 (2013) - [i20]Shashank Agrawal, Prabhanjan Ananth, Vipul Goyal, Manoj Prabhakaran, Alon Rosen:
Lower Bounds in the Hardware Token Model. IACR Cryptol. ePrint Arch. 2013: 827 (2013) - 2012
- [c27]Abhishek Banerjee, Chris Peikert, Alon Rosen:
Pseudorandom Functions and Lattices. EUROCRYPT 2012: 719-737 - [c26]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 - [c25]Krzysztof Pietrzak, Alon Rosen, Gil Segev:
Lossy Functions Do Not Amplify Well. TCC 2012: 458-475 - [c24]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. TCC 2012: 600-617 - 2011
- [c23]Andrej Bogdanov, Alon Rosen:
Input Locality and Hardness Amplification. TCC 2011: 1-18 - [i19]R. Michael Alvarez, Josh Benaloh, Alon Rosen, Peter Y. A. Ryan:
Verifiable Elections and the Public (Dagstuhl Seminar 11281). Dagstuhl Reports 1(7): 36-52 (2011) - [i18]Andrej Bogdanov, Alon Rosen:
Input locality and hardness amplification. Electron. Colloquium Comput. Complex. 18: 12 (2011) - [i17]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. Electron. Colloquium Comput. Complex. 18: 126 (2011) - [i16]Abhishek Banerjee, Chris Peikert, Alon Rosen:
Pseudorandom Functions and Lattices. IACR Cryptol. ePrint Arch. 2011: 401 (2011) - [i15]Benny Applebaum, Andrej Bogdanov, Alon Rosen:
A Dichotomy for Local Small-Bias Generators. IACR Cryptol. ePrint Arch. 2011: 512 (2011) - 2010
- [j7]Alon Rosen, Gil Segev:
Chosen-Ciphertext Security via Correlated Products. SIAM J. Comput. 39(7): 3058-3088 (2010) - [c22]Alon Rosen, Abhi Shelat:
Optimistic Concurrent Zero Knowledge. ASIACRYPT 2010: 359-376 - [c21]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential Rationality in Cryptographic Protocols. FOCS 2010: 623-632 - [c20]Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jaggi, Alon Rosen:
RIPPLE Authentication for Network Coding. INFOCOM 2010: 2258-2266 - [c19]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295 - [i14]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential Rationality in Cryptographic Protocols. CoRR abs/1008.3123 (2010) - [i13]Ronen Gradwohl, Noam Livne, Alon Rosen:
Sequential Rationality in Cryptographic Protocols. IACR Cryptol. ePrint Arch. 2010: 448 (2010)
2000 – 2009
- 2009
- [c18]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. TCC 2009: 36-53 - [c17]Iftach Haitner, Alon Rosen, Ronen Shaltiel:
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols. TCC 2009: 220-237 - [c16]Alon Rosen, Gil Segev:
Chosen-Ciphertext Security via Correlated Products. TCC 2009: 419-436 - [i12]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. IACR Cryptol. ePrint Arch. 2009: 590 (2009) - 2008
- [j6]Rafael Pass, Alon Rosen:
Concurrent Nonmalleable Commitments. SIAM J. Comput. 37(6): 1891-1925 (2008) - [j5]Rafael Pass, Alon Rosen:
New and Improved Constructions of Nonmalleable Cryptographic Protocols. SIAM J. Comput. 38(2): 702-752 (2008) - [c15]Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen:
SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72 - [i11]Shien Jin Ong, David C. Parkes, Alon Rosen, Salil P. Vadhan:
Fairness with an Honest Minority and a Rational Majority. IACR Cryptol. ePrint Arch. 2008: 97 (2008) - [i10]Alon Rosen, Gil Segev:
Chosen-Ciphertext Security via Correlated Products. IACR Cryptol. ePrint Arch. 2008: 116 (2008) - [i9]Alon Rosen, Gil Segev:
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. IACR Cryptol. ePrint Arch. 2008: 134 (2008) - 2007
- [j4]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. J. Cryptol. 20(2): 165-202 (2007) - [c14]Chris Peikert, Alon Rosen:
Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007: 478-487 - 2006
- [b1]Alon Rosen:
Concurrent Zero-Knowledge - With Additional Background by Oded Goldreich. Information Security and Cryptography, Springer 2006, ISBN 978-3-540-32938-1, pp. I-XIII, 1-184 - [j3]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation: A Computational View. J. Cryptol. 19(4): 521-552 (2006) - [c13]Silvio Micali, Rafael Pass, Alon Rosen:
Input-Indistinguishable Computation. FOCS 2006: 367-378 - [c12]Chris Peikert, Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. TCC 2006: 145-166 - [i8]Chris Peikert, Alon Rosen:
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. Electron. Colloquium Comput. Complex. 13(147) (2006) - [i7]Chris Peikert, Alon Rosen:
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. IACR Cryptol. ePrint Arch. 2006: 444 (2006) - 2005
- [c11]Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold, Alon Rosen:
On Robust Combiners for Oblivious Transfer and Other Primitives. EUROCRYPT 2005: 96-113 - [c10]Rafael Pass, Alon Rosen:
Concurrent Non-Malleable Commitments. FOCS 2005: 563-572 - [c9]Rafael Pass, Alon Rosen:
New and improved constructions of non-malleable cryptographic protocols. STOC 2005: 533-542 - [i6]Chris Peikert, Alon Rosen:
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. Electron. Colloquium Comput. Complex.(158) (2005) - 2004
- [c8]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in two-party secure computation: a computational view. STOC 2004: 252-261 - [c7]Alon Rosen:
A Note on Constant-Round Zero-Knowledge Proofs for NP. TCC 2004: 191-202 - [c6]Yan Zong Ding, Danny Harnik, Alon Rosen, Ronen Shaltiel:
Constant-Round Oblivious Transfer in the Bounded Storage Model. TCC 2004: 446-472 - 2003
- [c5]Rafael Pass, Alon Rosen:
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. FOCS 2003: 404-413 - [i5]Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen:
Completeness in Two-Party Secure Computation - A Computational View. Electron. Colloquium Comput. Complex.(060) (2003) - 2002
- [j2]Moni Naor, Omer Reingold, Alon Rosen:
Pseudorandom Functions and Factoring. SIAM J. Comput. 31(5): 1383-1404 (2002) - [j1]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds. SIAM J. Comput. 32(1): 1-47 (2002) - [c4]Manoj Prabhakaran, Alon Rosen, Amit Sahai:
Concurrent Zero Knowledge with Logarithmic Round-Complexity. FOCS 2002: 366-375 - 2001
- [c3]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-box concurrent zero-knowledge requires Omega~(log n) rounds. STOC 2001: 570-579 - [i4]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires ~Omega(log n) Rounds. Electron. Colloquium Comput. Complex. 8(50) (2001) - [i3]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. Electron. Colloquium Comput. Complex. 8(064) (2001) - [i2]Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen:
Black-Box Concurrent Zero-Knowledge Requires Omega(log n) Rounds. IACR Cryptol. ePrint Arch. 2001: 51 (2001) - [i1]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-Random Functions and Factoring. IACR Cryptol. ePrint Arch. 2001: 75 (2001) - 2000
- [c2]Alon Rosen:
A Note on the Round-Complexity of Concurrent Zero-Knowledge. CRYPTO 2000: 451-468 - [c1]Moni Naor, Omer Reingold, Alon Rosen:
Pseudo-random functions and factoring (extended abstract). STOC 2000: 11-20