I agree that this site is using cookies. You can find further informations here.
X
Ganesh, Chaya
35  results:
Search for persons X
?
1

How to Make Rational Arguments Practical and Extractable:

Campanelli, Matteo ; Ganesh, Chaya ; Gennaro, Rosario
IACR Communications in Cryptology.  , 2024
Link: https://doi.org/10.62056..
 
?
2

Succinct Verification of Compressed Sigma Protocols in the ..:

, In: Lecture Notes in Computer Science; Public-Key Cryptography – PKC 2024,
Dutta, Moumita ; Ganesh, Chaya ; Jawalkar, Neha - p. 305-336 , 2024
Link: https://doi.org/10.1007/..
 
?
3

Rinocchio: SNARKs for Ring Arithmetic:

Ganesh, Chaya ; Nitulescu, Anca ; Soria-Vazquez, Eduardo
Journal of Cryptology.  36 (2023)  4 - p. , 2023
Link: https://doi.org/10.1007/..
 
?
4

Reverse Firewalls for Oblivious Transfer Extension and Appl..:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Chakraborty, Suvradip ; Ganesh, Chaya ; Sarkar, Pratik - p. 239-270 , 2023
Link: https://doi.org/10.1007/..
 
?
5

Impossibilities in Succinct Arguments: Black-Box Extraction..:

, In: Progress in Cryptology - AFRICACRYPT 2023; Lecture Notes in Computer Science,
Campanelli, Matteo ; Ganesh, Chaya ; Khoshakhlagh, Hamidreza. - p. 465-489 , 2023
Link: https://doi.org/10.1007/..
 
?
6

Witness-Succinct Universally-Composable SNARKs:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Ganesh, Chaya ; Kondi, Yashvanth ; Orlandi, Claudio... - p. 315-346 , 2023
Link: https://doi.org/10.1007/..
 
?
7

Dew: A Transparent Constant-Sized Polynomial Commitment Sch..:

, In: Lecture Notes in Computer Science; Public-Key Cryptography – PKC 2023,
Arun, Arasu ; Ganesh, Chaya ; Lokam, Satya.. - p. 542-571 , 2023
Link: https://doi.org/10.1007/..
 
?
8

Virtual ASICs: Generalized Proof-of-Stake Mining in Cryptoc..:

, In: Lecture Notes in Computer Science; Data Privacy Management, Cryptocurrencies and Blockchain Technology,
Ganesh, Chaya ; Orlandi, Claudio ; Tschudi, Daniel. - p. 173-191 , 2022
Link: https://doi.org/10.1007/..
 
?
9

NIWI and New Notions of Extraction for Algebraic Languages:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Ganesh, Chaya ; Khoshakhlagh, Hamidreza ; Parisella, Roberto - p. 687-710 , 2022
Link: https://doi.org/10.1007/..
 
?
10

ECLIPSE: Enhanced Compiling Method for Pedersen-Committed z..:

, In: Public-Key Cryptography – PKC 2022; Lecture Notes in Computer Science,
Aranha, Diego F. ; Bennedsen, Emil Madsen ; Campanelli, Matteo... - p. 584-614 , 2022
Link: https://doi.org/10.1007/..
 
?
11

Secure Auctions in the Presence of Rational Adversaries:

, In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security,
Ganesh, Chaya ; Kanukurthi, Bhavana ; Shankar, Girisha - p. 1173-1186 , 2022
Link: https://dl.acm.org/doi/1..
 
?
12

Achieving Almost All Blockchain Functionalities with Polylo..:

, In: Financial Cryptography and Data Security; Lecture Notes in Computer Science,
Hegde, Parikshit ; Streit, Robert ; Georghiades, Yanni.. - p. 642-660 , 2022
Link: https://doi.org/10.1007/..
 
?
13

What Makes Fiat–Shamir zkSNARKs (Updatable SRS) Simulation ..:

, In: Lecture Notes in Computer Science; Security and Cryptography for Networks,
Ganesh, Chaya ; Khoshakhlagh, Hamidreza ; Kohlweiss, Markulf.. - p. 735-760 , 2022
Link: https://doi.org/10.1007/..
 
?
14

Fiat–Shamir Bulletproofs are Non-Malleable (in the Algebrai..:

, In: Advances in Cryptology – EUROCRYPT 2022; Lecture Notes in Computer Science,
Ganesh, Chaya ; Orlandi, Claudio ; Pancholi, Mahak.. - p. 397-426 , 2022
Link: https://doi.org/10.1007/..
 
?
15

Balancing Privacy and Accountability in Blockchain Identity..:

, In: Topics in Cryptology – CT-RSA 2021; Lecture Notes in Computer Science,
Damgård, Ivan ; Ganesh, Chaya ; Khoshakhlagh, Hamidreza.. - p. 552-576 , 2021
Link: https://doi.org/10.1007/..
 
1-15