Obserwuj
Sri Aravinda Krishnan Thyagarajan
Sri Aravinda Krishnan Thyagarajan
Lecturer at the University of Sydney
Brak zweryfikowanego adresu e-mail - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Redactable blockchain in the permissionless setting
D Deuber, B Magri, SAK Thyagarajan
2019 IEEE Symposium on Security and Privacy (SP), 124-138, 2019
2172019
Homomorphic time-lock puzzles and applications
G Malavolta, SAK Thyagarajan
Annual International Cryptology Conference, 620-649, 2019
1442019
Universal atomic swaps: Secure exchange of coins across all blockchains
SAK Thyagarajan, G Malavolta, P Moreno-Sanchez
2022 IEEE symposium on security and privacy (SP), 1299-1316, 2022
1182022
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable
MR Albrecht, V Cini, RWF Lai, G Malavolta, SAK Thyagarajan
Annual International Cryptology Conference, 102-132, 2022
872022
Omniring: Scaling private payments without trusted setup
RWF Lai, V Ronge, T Ruffing, D Schröder, SAK Thyagarajan, J Wang
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications …, 2019
812019
Verifiable timed signatures made practical
SAK Thyagarajan, A Bhat, G Malavolta, N Döttling, A Kate, D Schröder
Proceedings of the 2020 ACM SIGSAC conference on computer and communications …, 2020
752020
Efficient CCA timed commitments in class groups
SAK Thyagarajan, G Castagnos, F Laguillaumie, G Malavolta
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
412021
Lockable signatures for blockchains: Scriptless scripts for all signatures
SAK Thyagarajan, G Malavolta
2021 IEEE symposium on security and privacy (SP), 937-954, 2021
402021
Reparo: Publicly verifiable layer to repair blockchains
SAK Thyagarajan, A Bhat, B Magri, D Tschudi, A Kate
International Conference on Financial Cryptography and Data Security, 37-56, 2021
402021
Sleepy channels: Bi-directional payment channels without watchtowers
L Aumayr, SAK Thyagarajan, G Malavolta, P Moreno-Sanchez, M Maffei
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications …, 2022
362022
Foundations of coin mixing services
N Glaeser, M Maffei, G Malavolta, P Moreno-Sanchez, E Tairi, ...
Proceedings of the 2022 ACM SIGSAC conference on computer and communications …, 2022
322022
Efficient invisible and unlinkable sanitizable signatures
X Bultel, P Lafourcade, RWF Lai, G Malavolta, D Schröder, ...
Public-Key Cryptography–PKC 2019: 22nd IACR International Conference on …, 2019
302019
Paymo: Payment channels for monero
SAK Thyagarajan, G Malavolta, F Schmidt, D Schröder
Cryptology ePrint Archive, 2020
282020
Non-interactive VSS using Class Groups and Application to DKG
A Kate, EV Mangipudi, P Mukherjee, H Saleem, SAK Thyagarajan
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and …, 2024
242024
(Short Paper) Burning Zerocoins for Fun and for Profit-A Cryptographic Denial-of-Spending Attack on the Zerocoin Protocol
T Ruffing, SA Thyagarajan, V Ronge, D Schroder
2018 Crypto Valley Conference on Blockchain Technology (CVCBT), 116-119, 2018
242018
Verifiable timed linkable ring signatures for scalable payments for monero
SAK Thyagarajan, G Malavolta, F Schmid, D Schröder
European Symposium on Research in Computer Security, 467-486, 2022
222022
Transparent batchable time-lock puzzles and applications to byzantine consensus
S Srinivasan, J Loss, G Malavolta, K Nayak, C Papamanthou, ...
IACR International Conference on Public-Key Cryptography, 554-584, 2023
212023
Opensquare: Decentralized repeated modular squaring service
SAK Thyagarajan, T Gong, A Bhat, A Kate, D Schröder
Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications …, 2021
202021
Minting mechanism for proof of stake blockchains
D Deuber, N Döttling, B Magri, G Malavolta, SAK Thyagarajan
Applied Cryptography and Network Security: 18th International Conference …, 2020
192020
Cryptographic oracle-based conditional payments
V Madathil, SAK Thyagarajan, D Vasilopoulos, L Fournier, G Malavolta, ...
Cryptology ePrint Archive, 2022
172022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20