ROSEN, ALON
ROSEN, ALON
Dipartimento di Scienze della Computazione
Acyclicity programming for sigma-protocols
2021 Abe, Masayuki; Ambrona, Miguel; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon
An algebraic approach to Nonmalleability
2021 Goyal, Vipul; Richelson, Silas; Rosen, Alon; Vald, Margarita
Average-case fine-grained hardness
2017 Ball, Marshall; Rosen, Alon; Sabin, Manuel; Vasudevan, Prashant Nalini
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
2002 Canetti, Ran; Kiliany, Joe; Petrankz, Erez; Rosen, Alon
Can PPAD hardness be based on standard cryptographic assumptions?
2021 Rosen, Alon; Segev, Gil; Shahaf, Ido
Candidate Weak Pseudorandom Functions in AC0 ◦ MOD2
2014 Akavia, Adi; Bogdanov, Andrej; Guo, Siyao; Kamath, Akshay; Rosen, Alon
CDS Composition of Multi-round Protocols
2024 Abe, Masayuki; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon; Shang, Zehua; Tibouchi, Mehdi
Cryptography from information loss
2020 Ball, Marshall; Boyle, Elette; Degwekar, Akshay; Deshpande, Apoorvaa; Rosen, Alon; Vaikuntanathan, Vinod; Vasudevan, Prashant Nalini
Cryptography from one-way communication: on completeness of finite channels
2020 Agrawal, Shweta; Ishai, Yuval; Kushilevitz, Eyal; Narayanan, Varun; Prabhakaran, Manoj; Prabhakaran, Vinod; Rosen, Alon
Downward Self-Reducibility in TFNP
2023 Harsha, Prahladh; Mitropolsky, Daniel; Rosen, Alon
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
2019 Rai Choudhuri, Arka; Hub('(a))cek, Pavel; Kamath, Chethan; Pietrzak, Krzysztof; Rosen, Alon; Rothblum, Guy N.
Limits on the efficiency of (ring) LWE based non-interactive key exchange
2020 Guo, Siyao; Kamath, Pritish; Rosen, Alon; Sotiraki, Katerina
Limits on the efficiency of (ring) LWE-based non-interactive key exchange
2022 Guo, Siyao; Kamath, Pritish; Rosen, Alon; Sotiraki, Katerina
Low-Degree Security of the Planted Random Subgraph Problem
2025 Bogdanov, Andrej; Jones, Chris; Rosen, Alon; Zadik, Ilias
Non-interactive composition of Sigma-Protocols via Share-then-Hash
2020 Abe, Masayuki; Ambrona, Miguel; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon
Nondeterministic Interactive Refutations for Nearest Boolean Vector
2023 Bogdanov, Andrej; Rosen, Alon
On the Cryptographic Hardness of Finding a Nash Equilibrium
2015 Bitansky, Nir; Paneth, Omer; Rosen, Alon
On the existence of extractable one-way functions
2014 Bitansky, Nir; Canetti, Ran; Paneth, Omer; Rosen, Alon
On the Existence of Extractable One-Way Functions
2016 Bitansky, Nir; Canetti, Ran; Paneth, Omer; Rosen, Alon
On the Hardness of Learning with Rounding over Small Modulus
2015 Bogdanov, Andrej; Guo, Siyao; Masny, Daniel; Richelson, Silas; Rosen, Alon
Titolo | Data di pubblicazione | Autore(i) | Rivista | Editore |
---|---|---|---|---|
Acyclicity programming for sigma-protocols | 1-gen-2021 | Abe, Masayuki; Ambrona, Miguel; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon | - | Springer |
An algebraic approach to Nonmalleability | 1-gen-2021 | Goyal, Vipul; Richelson, Silas; Rosen, Alon; Vald, Margarita | SIAM JOURNAL ON COMPUTING | - |
Average-case fine-grained hardness | 1-gen-2017 | Ball, Marshall; Rosen, Alon; Sabin, Manuel; Vasudevan, Prashant Nalini | - | Association for Computing Machinery |
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds | 1-gen-2002 | Canetti, Ran; Kiliany, Joe; Petrankz, Erez; Rosen, Alon | SIAM JOURNAL ON COMPUTING | - |
Can PPAD hardness be based on standard cryptographic assumptions? | 1-gen-2021 | Rosen, Alon; Segev, Gil; Shahaf, Ido | JOURNAL OF CRYPTOLOGY | - |
Candidate Weak Pseudorandom Functions in AC0 ◦ MOD2 | 1-gen-2014 | Akavia, Adi; Bogdanov, Andrej; Guo, Siyao; Kamath, Akshay; Rosen, Alon | - | Association for Computing Machinery |
CDS Composition of Multi-round Protocols | 1-gen-2024 | Abe, Masayuki; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon; Shang, Zehua; Tibouchi, Mehdi | - | Springer |
Cryptography from information loss | 1-gen-2020 | Ball, Marshall; Boyle, Elette; Degwekar, Akshay; Deshpande, Apoorvaa; Rosen, Alon; Vaikuntanathan, Vinod; Vasudevan, Prashant Nalini | - | (seleziona...) |
Cryptography from one-way communication: on completeness of finite channels | 1-gen-2020 | Agrawal, Shweta; Ishai, Yuval; Kushilevitz, Eyal; Narayanan, Varun; Prabhakaran, Manoj; Prabhakaran, Vinod; Rosen, Alon | - | Springer |
Downward Self-Reducibility in TFNP | 1-gen-2023 | Harsha, Prahladh; Mitropolsky, Daniel; Rosen, Alon | - | (seleziona...) |
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir | 1-gen-2019 | Rai Choudhuri, Arka; Hub('(a))cek, Pavel; Kamath, Chethan; Pietrzak, Krzysztof; Rosen, Alon; Rothblum, Guy N. | - | (seleziona...) |
Limits on the efficiency of (ring) LWE based non-interactive key exchange | 1-gen-2020 | Guo, Siyao; Kamath, Pritish; Rosen, Alon; Sotiraki, Katerina | - | Springer |
Limits on the efficiency of (ring) LWE-based non-interactive key exchange | 1-gen-2022 | Guo, Siyao; Kamath, Pritish; Rosen, Alon; Sotiraki, Katerina | JOURNAL OF CRYPTOLOGY | - |
Low-Degree Security of the Planted Random Subgraph Problem | 1-gen-2025 | Bogdanov, Andrej; Jones, Chris; Rosen, Alon; Zadik, Ilias | - | Springer |
Non-interactive composition of Sigma-Protocols via Share-then-Hash | 1-gen-2020 | Abe, Masayuki; Ambrona, Miguel; Bogdanov, Andrej; Ohkubo, Miyako; Rosen, Alon | - | Springer |
Nondeterministic Interactive Refutations for Nearest Boolean Vector | 1-gen-2023 | Bogdanov, Andrej; Rosen, Alon | - | (seleziona...) |
On the Cryptographic Hardness of Finding a Nash Equilibrium | 1-gen-2015 | Bitansky, Nir; Paneth, Omer; Rosen, Alon | - | (seleziona...) |
On the existence of extractable one-way functions | 1-gen-2014 | Bitansky, Nir; Canetti, Ran; Paneth, Omer; Rosen, Alon | - | Association for Computing Machinery |
On the Existence of Extractable One-Way Functions | 1-gen-2016 | Bitansky, Nir; Canetti, Ran; Paneth, Omer; Rosen, Alon | SIAM JOURNAL ON COMPUTING | - |
On the Hardness of Learning with Rounding over Small Modulus | 1-gen-2015 | Bogdanov, Andrej; Guo, Siyao; Masny, Daniel; Richelson, Silas; Rosen, Alon | - | (seleziona...) |