×
Compute Distance To:
Author ID: ghosh.satrajit Recent zbMATH articles by "Ghosh, Satrajit"
Published as: Ghosh, Satrajit
Homepage: http://pure.au.dk/portal/en/satrajit@cs.au.dk
Documents Indexed: 15 Publications since 1977
Co-Authors: 7 Co-Authors with 5 Joint Publications
128 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

9 Publications have been cited 35 times in 13 Documents Cited by Year
More precise tables of optimal balanced \(2^ m\) fractional factorial designs of Srivastava and Chopra, 7\(\leq m\leq 10\). Zbl 0616.62108
Chopra, D. V.; Kipngeno, W. A. K.; Ghosh, S.
8
1986
Maliciously secure oblivious linear function evaluation with constant overhead. Zbl 1420.94067
Ghosh, Satrajit; Nielsen, Jesper Buus; Nilges, Tobias
6
2017
The communication complexity of threshold private set intersection. Zbl 1478.68092
Ghosh, Satrajit; Simkin, Mark
6
2019
An algebraic approach to maliciously secure private set intersection. Zbl 07162727
Ghosh, Satrajit; Nilges, Tobias
6
2019
Enumeration and representation of nonisomorphic bipartite graphs. Zbl 0445.05054
Srivastava, J. N.; Ghosh, S.
4
1980
Heisenberg uniqueness pairs on the Euclidean spaces and the motion group. (Paires d’unicité de Heisenberg sur les espaces euclidiens et le groupe des mouvements.) Zbl 1444.42004
Chattopadhyay, Arup; Ghosh, S.; Giri, D. K.; Srivastava, R. K.
2
2020
Post-quantum forward-secure onion routing (future anonymity in today’s budget). Zbl 1459.68009
Ghosh, Satrajit; Kate, Aniket
1
2015
On robustness of \(2^ m \times 3^ n\) fractional factorial resolution III designs against the unavailability of data. Zbl 0825.62653
Namini, H.; Ghosh, S.
1
1990
On the existence of search designs with continuous factors. Zbl 0425.62059
Srivastava, J. N.; Ghosh, S.
1
1977
Heisenberg uniqueness pairs on the Euclidean spaces and the motion group. (Paires d’unicité de Heisenberg sur les espaces euclidiens et le groupe des mouvements.) Zbl 1444.42004
Chattopadhyay, Arup; Ghosh, S.; Giri, D. K.; Srivastava, R. K.
2
2020
The communication complexity of threshold private set intersection. Zbl 1478.68092
Ghosh, Satrajit; Simkin, Mark
6
2019
An algebraic approach to maliciously secure private set intersection. Zbl 07162727
Ghosh, Satrajit; Nilges, Tobias
6
2019
Maliciously secure oblivious linear function evaluation with constant overhead. Zbl 1420.94067
Ghosh, Satrajit; Nielsen, Jesper Buus; Nilges, Tobias
6
2017
Post-quantum forward-secure onion routing (future anonymity in today’s budget). Zbl 1459.68009
Ghosh, Satrajit; Kate, Aniket
1
2015
On robustness of \(2^ m \times 3^ n\) fractional factorial resolution III designs against the unavailability of data. Zbl 0825.62653
Namini, H.; Ghosh, S.
1
1990
More precise tables of optimal balanced \(2^ m\) fractional factorial designs of Srivastava and Chopra, 7\(\leq m\leq 10\). Zbl 0616.62108
Chopra, D. V.; Kipngeno, W. A. K.; Ghosh, S.
8
1986
Enumeration and representation of nonisomorphic bipartite graphs. Zbl 0445.05054
Srivastava, J. N.; Ghosh, S.
4
1980
On the existence of search designs with continuous factors. Zbl 0425.62059
Srivastava, J. N.; Ghosh, S.
1
1977

Citations by Year