![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Satrajit Ghosh
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c12]Jakob Burkhardt
, Ivan Damgård
, Tore Kasper Frederiksen
, Satrajit Ghosh
, Claudio Orlandi
:
Improved Distributed RSA Key Generation Using the Miller-Rabin Test. CCS 2023: 2501-2515 - [c11]Satrajit Ghosh, Mark Simkin:
Threshold Private Set Intersection with Better Communication Complexity. Public Key Cryptography (2) 2023: 251-272 - [i10]Jakob Burkhardt, Ivan Damgård, Tore Kasper Frederiksen, Satrajit Ghosh, Claudio Orlandi:
Improved Distributed RSA Key Generation Using the Miller-Rabin Test. IACR Cryptol. ePrint Arch. 2023: 644 (2023) - [i9]Satrajit Ghosh, Mark Simkin:
Threshold Private Set Intersection with Better Communication Complexity. IACR Cryptol. ePrint Arch. 2023: 919 (2023) - 2022
- [c10]Anit Kumar Ghosal
, Satrajit Ghosh
, Dipanwita Roychowdhury
:
Practical Non-malleable Codes from Symmetric-Key Primitives in 2-Split-State Model. ProvSec 2022: 273-281 - 2021
- [c9]Utkarsh Sarawgi, Rishab Khincha, Wazeer Zulfikar, Satrajit Ghosh, Pattie Maes:
Uncertainty-Aware Boosted Ensembling in Multi-Modal Settings. IJCNN 2021: 1-9 - [i8]Utkarsh Sarawgi, Rishab Khincha, Wazeer Zulfikar, Satrajit Ghosh, Pattie Maes:
Uncertainty-Aware Boosted Ensembling in Multi-Modal Settings. CoRR abs/2104.10715 (2021) - 2020
- [c8]Daniel Escudero, Satrajit Ghosh, Marcel Keller
, Rahul Rachuri, Peter Scholl:
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. CRYPTO (2) 2020: 823-852 - [i7]Daniel Escudero, Satrajit Ghosh, Marcel Keller, Rahul Rachuri, Peter Scholl:
Improved Primitives for MPC over Mixed Arithmetic-Binary Circuits. IACR Cryptol. ePrint Arch. 2020: 338 (2020)
2010 – 2019
- 2019
- [c7]Satrajit Ghosh, Mark Simkin:
The Communication Complexity of Threshold Private Set Intersection. CRYPTO (2) 2019: 3-29 - [c6]Satrajit Ghosh, Tobias Nilges:
An Algebraic Approach to Maliciously Secure Private Set Intersection. EUROCRYPT (3) 2019: 154-185 - [i6]Satrajit Ghosh, Mark Simkin:
The Communication Complexity of Threshold Private Set Intersection. IACR Cryptol. ePrint Arch. 2019: 175 (2019) - 2018
- [d1]Krzysztof J. Gorgolewski
, Oscar Esteban
, Christopher J. Markiewicz
, Erik Ziegler
, David Gage Ellis
, Dorota Jarecka, Michael Philipp Notter
, Hans Johnson
, Christopher Burns, Alexandre Manhães-Savio
, Carlo Hamalainen
, Benjamin Yvernault, Taylor Salo
, Mathias Goncalves
, Kesshi Jordan
, Michael Waskom, Jason Wong, Marc Modat, Fred Loney, Daniel Clark
, Blake E. Dewey
, Dylan M. Nielson
, Cindee Madison, Salma Bougacha, Matteo Visconti di Oleggio Castello
, Michael G. Clark, Michael Dayan
, Dav Clark
, Anisha Keshavan
, Basile Pinsard, Alexandre Gramfort
, Shoshana Berleant, Ben Cipollini
, Yaroslav O. Halchenko
, Ross Markello
, Ariel Rokem
, Elizabeth DuPre
, Jakub Kaczmarzyk
, Brendan Moloney, Gael Varoquaux
, Christian Horea
, Demian Wassermann
, Michael Hanke
, Gilles de Hollander
, Ashley Gillman
, David Mordom, Colin Buchanan, Rosalia Tungaraza, Wolfgang M. Pauli
, Shariq Iqbal
, Sharad Sikka, Matteo Mancini
, Jessica Forbes, Yannick Schwartz, Ian B. Malone
, Mathieu Dubois, Caroline Frohlich, David Welch, James Kent, Aimi Watanabe, Julia M. Huntenburg
, Chad Cumba, B. Nolan Nichols
, Arman Eshaghi
, Erik Kastman
, Daniel Ginsburg, Alexander Schaefer
, Benjamin Acland
, Franz Liem
, Jens Kleesiek, Drew Erickson, Steven Giavasis, Christian Haselgrove, Carlos Correa, Ali Ghayoor, René Küttner, Jarrod Millman, Jeff Lai, Dale Zhou, Ross Blair, Tristan Glatard
, Mandy Renfro, Siqi Liu, Ari E. Kahn
, Fernando Pérez-García
, William Triplett
, Leonie Lampe, Jörg Stadler
, Xiang-Zhen Kong
, Michael Hallquist, Andrey Chetverikov
, John Salvatore, Anne Park, Russell Poldrack, R. Cameron Craddock
, Oliver Hinds, Gavin Cooper
, Leon Weninger, Souheil Inati, L. Nathan Perkins, Lukas Snoek
, Ana Marina, Aaron Mattfeld, K. Matsubara, Maxime Noel, Brian Cheung, Andrew Floren
, Sebastian Urchs, Joke Durnez
, Fred Mertz, Daniel Haehn, Daniel Geisler
, Alejandro De La Vega
, Paul Sharp, Stephan Gerhard
, Miguel Molina-Romero
, Alejandro Weinstein, Arielle Tambini, William Broderick
, Victor Saase, Simon Rothmei, Sami Kristian Andberg
, Robbert Harms, Ranjeet Khanuja, Kai Schlamp, Jaime Arias, Dimitri Papadopoulos Orfanos
, Claire Tarbert, Eduard Ort, Thomas Nickson, Matthew Brett, Marcel Falkiewicz, Kornelius Podranski, Janosch Linkersdörfer
, Guillaume Flandin, Dmitry Shachnev, Daniel McNamee
, Andrew Davison, Jan Varada, Isaac Schwabacher, John Pellman
, Martin Perez-Guevara, Nicolas Pannetier
, Conor McDermottroe, Satrajit Ghosh
:
nipy/nipype: 1.1.4. Zenodo, 2018 - 2017
- [c5]Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges:
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. ASIACRYPT (1) 2017: 629-659 - [c4]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. CCS 2017: 2263-2276 - [i5]Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges:
Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead. IACR Cryptol. ePrint Arch. 2017: 409 (2017) - [i4]Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen, Tobias Nilges, Roberto Trifiletti:
TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. IACR Cryptol. ePrint Arch. 2017: 790 (2017) - [i3]Satrajit Ghosh, Tobias Nilges:
An Algebraic Approach to Maliciously Secure Private Set Intersection. IACR Cryptol. ePrint Arch. 2017: 1064 (2017) - 2015
- [c3]Satrajit Ghosh, Aniket Kate:
Post-Quantum Forward-Secure Onion Routing - (Future Anonymity in Today's Budget). ACNS 2015: 263-286 - [i2]Satrajit Ghosh, Aniket Kate:
Post-Quantum Secure Onion Routing (Future Anonymity in Today's Budget). IACR Cryptol. ePrint Arch. 2015: 8 (2015) - 2014
- [j1]Subrata Das, Satrajit Ghosh, Parthasarathi Dasgupta, Samar Sen-Sarma:
Algorithms for rotation symmetric Boolean functions. Int. J. Inf. Coding Theory 2(4): 238-265 (2014) - 2012
- [c2]Subhajit Guha, Partha Pratim Das, Satrajit Ghosh:
A novel approach for identification of symmetric switching function. RAIT 2012: 731-736 - [i1]Satrajit Ghosh, Abhijit Das:
Improvements of Algebraic Attacks Based on Structured Gaussian Elimination. IACR Cryptol. ePrint Arch. 2012: 176 (2012) - 2011
- [c1]Satrajit Ghosh, Abhijit Das:
An Improvement of Linearization-Based Algebraic Attacks. InfoSecHiComNet 2011: 157-167
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint