( en | de | ru )

 

Disambiguation of "Shaltiel, Ronen"

Author of the publication

copydeleteadd this publication to your clipboard
Reducing Complexity Assumptions for Statistically-Hiding Commitment.

, , , , , and . J. Cryptol., 22 (3): 283-310 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ronen Sircar

Ronen Reichman

Ronen Elishar

Roy Ronen

 

Other publications of authors with the same name

Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors., , , , and . STOC, page 1-10. ACM, (2005)Typically-correct derandomization.. SIGACT News, 41 (2): 57-72 (2010)On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols., , and . TCC, volume 5444 of Lecture Notes in Computer Science, page 220-237. Springer, (2009)True Random Number Generators Secure in a Changing Environment., , and . CHES, volume 2779 of Lecture Notes in Computer Science, page 166-180. Springer, (2003)Constant-Round Oblivious Transfer in the Bounded Storage Model., , , and . TCC, volume 2951 of Lecture Notes in Computer Science, page 446-472. Springer, (2004)If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances., , and . Comput. Complex., 16 (4): 412-441 (2007)Towards proving strong direct product theorems.. Comput. Complex., 12 (1-2): 1-22 (2003)Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels., and . Comput. Complex., 30 (1): 3 (2021)Low-end uniform hardness vs. randomness tradeoffs for AM., and . Electron. Colloquium Comput. Complex., (2007)Mining Circuit Lower Bound Proofs for Meta-Algorithms., , , , and . Electron. Colloquium Comput. Complex., (2013)