Prastudy Fauzi

Orcid: 0000-0001-6800-7821

According to our database1, Prastudy Fauzi authored at least 12 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Shuffle Arguments Based on Subset-Checking.
Proceedings of the Security and Cryptography for Networks - 14th International Conference, 2024

2022
On the IND-CCA1 Security of FHE Schemes.
Cryptogr., 2022

2021
A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem.
Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Somewhere Statistically Binding Commitment Schemes with Applications.
Proceedings of the Financial Cryptography and Data Security, 2021

Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
A Non-interactive Shuffle Argument with Low Trust Assumptions.
Proceedings of the Topics in Cryptology - CT-RSA 2020, 2020

2019
Quisquis: A New Design for Anonymous Cryptocurrencies.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2017
An Efficient Pairing-Based Shuffle Argument.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Efficient Culpably Sound NIZK Shuffle Argument Without Random Oracles.
Proceedings of the Topics in Cryptology - CT-RSA 2016 - The Cryptographers' Track at the RSA Conference 2016, San Francisco, CA, USA, February 29, 2016

A Shuffle Argument Secure in the Generic Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2014
Efficient Non-Interactive Zero Knowledge Arguments for Set Operations.
Proceedings of the Financial Cryptography and Data Security, 2014

2013
Efficient Modular NIZK Arguments from Shift and Product.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013


  Loading...