Các bài viết có thể truy cập công khai - Muthuramakrishnan VenkitasubramaniamTìm hiểu thêm
Không có ở bất kỳ nơi nào: 1
Is the classical GMW paradigm practical? the case of non-interactive actively secure 2pc
J Abascal, MH Faghihi Sereshgi, C Hazay, Y Ishai, ...
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, US Office of the …
Có tại một số nơi: 31
Ligero: Lightweight sublinear arguments without a trusted setup
S Ames, C Hazay, Y Ishai, M Venkitasubramaniam
Proceedings of the 2017 acm sigsac conference on computer and communications …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, European Commission
Scalable multi-party private set-intersection
C Hazay, M Venkitasubramaniam
IACR international workshop on public key cryptography, 175-203, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, European Commission
Ligero++: A new optimized sublinear IOP
R Bhadauria, Z Fang, C Hazay, M Venkitasubramaniam, T Xie, Y Zhang
Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications …, 2020
Các cơ quan ủy nhiệm: US Department of Defense
Round-optimal secure multi-party computation
S Halevi, C Hazay, A Polychroniadou, M Venkitasubramaniam
Journal of Cryptology 34 (3), 19, 2021
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense
Diogenes: lightweight scalable RSA modulus generation with a dishonest majority
M Chen, C Hazay, Y Ishai, Y Kashnikov, D Micciancio, T Riviere, A Shelat, ...
2021 IEEE Symposium on Security and Privacy (SP), 590-607, 2021
Các cơ quan ủy nhiệm: US National Science Foundation
On the power of secure two-party computation
C Hazay, M Venkitasubramaniam
Annual International Cryptology Conference, 397-429, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, European Commission
LevioSA: Lightweight secure arithmetic computation
C Hazay, Y Ishai, A Marcedone, M Venkitasubramaniam
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, Department of …
4-round resettably-sound zero knowledge
KM Chung, R Ostrovsky, R Pass, M Venkitasubramaniam, I Visconti
Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014 …, 2014
Các cơ quan ủy nhiệm: Government of Italy
Composable security in the tamper-proof hardware model under minimal complexity
C Hazay, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
Các cơ quan ủy nhiệm: US National Science Foundation, National Natural Science Foundation of China …
Equivocating yao: constant-round adaptively secure multiparty computation in the plain model
R Canetti, O Poburinnaya, M Venkitasubramaniam
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation
Actively secure garbled circuits with constant communication overhead in the plain model
C Hazay, Y Ishai, M Venkitasubramaniam
Theory of Cryptography Conference, 3-39, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, European Commission
Two-round adaptively secure multiparty computation from standard assumptions
F Benhamouda, H Lin, A Polychroniadou, M Venkitasubramaniam
Theory of Cryptography: 16th International Conference, TCC 2018, Panaji …, 2018
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense
The price of active security in cryptographic protocols
C Hazay, M Venkitasubramaniam, M Weiss
Annual International Conference on the Theory and Applications of …, 2020
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense, US Office of the …
Better two-round adaptive multi-party computation
R Canetti, O Poburinnaya, M Venkitasubramaniam
Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation
Constant round adaptively secure protocols in the tamper-proof hardware model
C Hazay, A Polychroniadou, M Venkitasubramaniam
Public-Key Cryptography–PKC 2017: 20th IACR International Conference on …, 2017
Các cơ quan ủy nhiệm: US National Science Foundation, Danish Council for Independent Research …
Round-optimal fully black-box zero-knowledge arguments from one-way permutations
C Hazay, M Venkitasubramaniam
Theory of Cryptography Conference, 263-285, 2018
Các cơ quan ủy nhiệm: US National Science Foundation
Composable adaptive secure protocols without setup under polytime assumptions
C Hazay, M Venkitasubramaniam
Theory of Cryptography Conference, 400-432, 2016
Các cơ quan ủy nhiệm: US National Science Foundation
On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
L Bangalore, R Bhadauria, C Hazay, M Venkitasubramaniam
Theory of Cryptography Conference, 417-446, 2022
Các cơ quan ủy nhiệm: US Department of Defense
Batchman and robin: Batched and non-batched branching for interactive ZK
Y Yang, D Heath, C Hazay, V Kolesnikov, M Venkitasubramaniam
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023
Các cơ quan ủy nhiệm: US National Science Foundation, US Department of Defense
Chương trình máy tính sẽ tự động xác định thông tin xuất bản và thông tin về nhà tài trợ