Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Arka Rai Choudhuri"'
Autor:
Arka Rai Choudhuri, Subhamoy Maitra
Publikováno v:
IACR Transactions on Symmetric Cryptology, Pp 261-287 (2017)
ChaCha and Salsa are two software oriented stream ciphers that have attracted serious attention in academic as well as commercial domain. The most important cryptanalysis of reduced versions of these ciphers was presented by Aumasson et al. in FSE 20
Externí odkaz:
https://doaj.org/article/c4b331c727244da9b38a7b49e3b21e36
Publikováno v:
Proceedings on Privacy Enhancing Technologies. 2023:79-102
In this work we propose time-deniable signatures (TDS), a new primitive that facilitates deniable authentication in protocols such as DKIM-signed email. As with traditional signatures, TDS provide strong authenticity for message content, at least {\e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05bde79a4a7c9ecdb3659056b23d0886
https://doi.org/10.56553/popets-2023-0071
https://doi.org/10.56553/popets-2023-0071
Publikováno v:
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94c21cede892c5c35ca5f36e793fb268
https://doi.org/10.1109/focs52979.2021.00016
https://doi.org/10.1109/focs52979.2021.00016
Autor:
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
Publikováno v:
Theory of Cryptography ISBN: 9783031223648
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::65c67eb5418f939152c2a8f529396591
https://doi.org/10.1007/978-3-031-22365-5_21
https://doi.org/10.1007/978-3-031-22365-5_21
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842444
CRYPTO (2)
CRYPTO (2)
Existing approaches to secure multiparty computation (MPC) require all participants to commit to the entire duration of the protocol. As interest in MPC continues to grow, it is inevitable that there will be a desire to use it to evaluate increasingl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64cf75b5cdacc1f4fc04dbe741e4c3a1
https://doi.org/10.1007/978-3-030-84245-1_4
https://doi.org/10.1007/978-3-030-84245-1_4
Publikováno v:
Advances in Cryptology – CRYPTO 2021 ISBN: 9783030842581
CRYPTO (4)
CRYPTO (4)
We study the problem of designing non-interactive batch arguments for \(\mathsf {NP}\). Such an argument system allows an efficient prover to prove multiple \(\mathsf {NP}\) statements, with size smaller than the combined witness length.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cd837b53df4c5e30800e8dc8913fcd5
https://doi.org/10.1007/978-3-030-84259-8_14
https://doi.org/10.1007/978-3-030-84259-8_14
Publikováno v:
Theory of Cryptography ISBN: 9783030904524
TCC (2)
TCC (2)
Oblivious transfer (OT) is a foundational primitive within cryptography owing to its connection with secure computation. One of the oldest constructions of oblivious transfer was from certified trapdoor permutations (TDPs). However several decades la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0148cecb02e25ab92d7870f6e83ee088
https://doi.org/10.1007/978-3-030-90453-1_18
https://doi.org/10.1007/978-3-030-90453-1_18
Autor:
Nir Bitansky, Arka Rai Choudhuri
Publikováno v:
Theory of Cryptography ISBN: 9783030643744
TCC (1)
TCC (1)
Randomness is typically thought to be essential for zero knowledge protocols. Following this intuition, Goldreich and Oren (Journal of Cryptology 94) proved that auxiliary-input zero knowledge cannot be achieved with a deterministic prover. On the ot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::31f92ccfe4fd805d1e4e7f8851518c94
https://doi.org/10.1007/978-3-030-64375-1_19
https://doi.org/10.1007/978-3-030-64375-1_19
Publikováno v:
Advances in Cryptology – ASIACRYPT 2020 ISBN: 9783030648398
ASIACRYPT (3)
ASIACRYPT (3)
Reducing the rounds of interaction in secure multiparty computation (MPC) protocols has been the topic of study of many works. One popular approach to reduce rounds is to construct round compression compilers. A round compression compiler is one that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4dabdafe6313749ee3ea5096aa30485c
https://doi.org/10.1007/978-3-030-64840-4_7
https://doi.org/10.1007/978-3-030-64840-4_7
Publikováno v:
Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176556
EUROCRYPT (2)
EUROCRYPT (2)
We provide the first constructions of two round information-theoretic (IT) secure multiparty computation (MPC) protocols in the plain model that tolerate any \(t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c1a561b550de7fbac87a9e22fc9e4e9
https://doi.org/10.1007/978-3-030-17656-3_19
https://doi.org/10.1007/978-3-030-17656-3_19