受强制性开放获取政策约束的文章 - Pratik Sarkar了解详情
可在其他位置公开访问的文章：13 篇
Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field
K Yang, P Sarkar, C Weng, X Wang
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense, 国家自然科学基金委员会
Triply adaptive uc nizk
R Canetti, P Sarkar, X Wang
International Conference on the Theory and Application of Cryptology and …, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
Efficient and round-optimal oblivious transfer and commitment with adaptive security
R Canetti, P Sarkar, X Wang
International Conference on the Theory and Application of Cryptology and …, 2020
强制性开放获取政策： US National Science Foundation, US Office of the Director of National …
Blazing fast OT for three-round UC OT extension
R Canetti, P Sarkar, X Wang
Public-Key Cryptography–PKC 2020: 23rd IACR International Conference on …, 2020
强制性开放获取政策： US National Science Foundation, US Office of the Director of National …
PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries
D Mouris, P Sarkar, NG Tsoutsos
Proceedings on Privacy Enhancing Technologies 2024 (3), 2024
强制性开放获取政策： US National Science Foundation, US Department of Defense
Reverse firewalls for adaptively secure MPC without setup
S Chakraborty, C Ganesh, M Pancholi, P Sarkar
International Conference on the Theory and Application of Cryptology and …, 2021
强制性开放获取政策： US National Science Foundation, European Commission
Round-optimal oblivious transfer and MPC from computational CSIDH
S Badrinarayanan, D Masny, P Mukherjee, S Patranabis, S Raghuraman, ...
IACR International Conference on Public-Key Cryptography, 376-405, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense
Statistical security in two-party computation revisited
S Badrinarayanan, S Patranabis, P Sarkar
Theory of Cryptography Conference, 181-210, 2022
强制性开放获取政策： US National Science Foundation, US Department of Defense
Two-round adaptively secure MPC from isogenies, LPN, or CDH
N Alamati, H Montgomery, S Patranabis, P Sarkar
International Conference on the Theory and Application of Cryptology and …, 2021
强制性开放获取政策： US National Science Foundation, US Department of Defense
Crash-tolerant consensus in directed graph revisited
A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar
Structural Information and Communication Complexity: 25th International …, 2018
强制性开放获取政策： Department of Science & Technology, India
Reverse Firewalls for Oblivious Transfer Extension and Applications to Zero-Knowledge
S Chakraborty, C Ganesh, P Sarkar
Annual International Conference on the Theory and Applications of …, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense, European Commission
Brief announcement: Crash-tolerant consensus in directed graph revisited
A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar
31st International Symposium on Distributed Computing (DISC 2017), 2017
强制性开放获取政策： Department of Science & Technology, India
Universally Composable Non-Interactive Zero-Knowledge from Sigma Protocols via a New Straight-line Compiler
M Chen, P Dey, C Ganesh, P Mukherjee, P Sarkar, S Sasmal
Cryptology ePrint Archive, 2024
强制性开放获取政策： US Department of Defense
出版信息和资助信息由计算机程序自动确定