Satrajit ghosh 个人学术档案

引用次数

	总计	2019 年至今
引用	438	409
h 指数	7	6
i10 指数	6	6

120

20122013201420152016201720182019202020212022202320242 2 2 2 1 5 14 29 32 79 97 117 54

开放获取的出版物数量

查看全部

6 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Jesper Buus NielsenProfessor of Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
Mark SimkinResearcher at Ethereum Foundation在 ethereum.org 的电子邮件经过验证
Marcel KellerCSIRO's Data61在 data61.csiro.au 的电子邮件经过验证
Rahul RachuriVisa Research在 visa.com 的电子邮件经过验证
Daniel EscuderoJP Morgan AI Research在 jpmorgan.com 的电子邮件经过验证
Peter SchollAarhus University在 cs.au.dk 的电子邮件经过验证
Aniket KatePurdue University / Supra Research在 purdue.edu 的电子邮件经过验证
Roberto TrifilettiPhD Student, Aarhus University在 cs.au.dk 的电子邮件经过验证
Nico DöttlingFaculty at the Helmholtz Center for Information Security (CISPA)在 cispa.de 的电子邮件经过验证
Abhijit DasProfessor, Department of Computer Science and Engineering, IIT Kharagpur在 cse.iitkgp.ac.in 的电子邮件经过验证
Ivan DamgårdProfessor of Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
Claudio OrlandiProfessor, Department of Computer Science, Aarhus University, Denmark在 cs.au.dk 的电子邮件经过验证
Tore Kasper FrederiksenBlockchain Cryptography Engineer, Zama在 zama.ai 的电子邮件经过验证
Jakob BurkhardtPhD Student在 cs.au.dk 的电子邮件经过验证
DIPANWITA ROYCHOWDHURYProfessor of Computer Science, IIT Kharagpur在 cse.iitkgp.ernet.in 的电子邮件经过验证

关注

Satrajit ghosh

IIT Kharagpur

在 cse.iitkgp.ac.in 的电子邮件经过验证 - 首页

Cryptography Secure Computation


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits D Escudero, S Ghosh, M Keller, R Rachuri, P Scholl	145	2020
An Algebraic Approach to Maliciously Secure Private Set Intersection S Ghosh, T Nilges Eurocrypt 2019, 2017	83	2017
The communication complexity of threshold private set intersection S Ghosh, M Simkin Annual International Cryptology Conference, 3-29, 2019	65	2019
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead S Ghosh, JB Nielsen, T Nilges	50	2017
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation N Döttling, S Ghosh, JB Nielsen, T Nilges, R Trifiletti Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017	49	2017
Post-Quantum Forward Secure Onion Routing S Ghosh, A Kate	24*	2015
An improvement of linearization-based algebraic attacks S Ghosh, A Das International Conference on Security Aspects in Information Technology, 157-167, 2011	7	2011
Improved Distributed RSA Key Generation Using the Miller-Rabin Test J Burkhardt, I Damgård, TK Frederiksen, S Ghosh, C Orlandi Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023	6	2023
Practical non-malleable codes from symmetric-key primitives in 2-split-state model AK Ghosal, S Ghosh, D Roychowdhury International Conference on Provable Security, 273-281, 2022	4	2022
Threshold Private Set Intersection with Better Communication Complexity S Ghosh, M Simkin IACR International Conference on Public-Key Cryptography, 251-272, 2023	2	2023
Improvements of algebraic attacks based on structured gaussian elimination S Ghosh, A Das Cryptology ePrint Archive, 2012	2	2012
Secure Computation Based On Oblivious Linear Function Evaluation S Ghosh Aarhus Universitet, 2019	1	2019
New Variants of Algebraic Attacks Based on Structured Gaussian Elimination S Ghosh, A Das		2012

系统目前无法执行此操作，请稍后再试。

文章 1–13

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用