2024
ELEKTRA: Efficient Lightweight multi-dEvice Key TRAnsparency.
IACR Cryptol. ePrint Arch., 2024
Weak Consistency mode in Key Transparency: OPTIKS.
IACR Cryptol. ePrint Arch., 2024
PathGES: An Efficient and Secure Graph Encryption Scheme for Shortest Path Queries.
IACR Cryptol. ePrint Arch., 2024
Anonymous Outsourced Statekeeping with Reduced Server Storage.
IACR Cryptol. ePrint Arch., 2024
Combing for Credentials: Active Pattern Extraction from Smart Reply.
Proceedings of the IEEE Symposium on Security and Privacy, 2024
2023
Parakeet: Practical Key Transparency for End-to-End Encrypted Messaging.
IACR Cryptol. ePrint Arch., 2023
Interoperability in End-to-End Encrypted Messaging.
IACR Cryptol. ePrint Arch., 2023
OPTIKS: An Optimized Key Transparency System.
IACR Cryptol. ePrint Arch., 2023
Does Prompt-Tuning Language Model Ensure Privacy?
CoRR, 2023
2022
Rotatable Zero Knowledge Sets: Post Compromise Secure Auditable Dictionaries with application to Key Transparency.
IACR Cryptol. ePrint Arch., 2022
Acsesor: A New Framework for Auditable Custodial Secret Storage and Recovery.
IACR Cryptol. ePrint Arch., 2022
Verifiable and Provably Secure Machine Unlearning.
CoRR, 2022
Active Data Pattern Extraction Attacks on Generative Language Models.
CoRR, 2022
Credential Transparency System.
Proceedings of the Security and Cryptography for Networks - 13th International Conference, 2022
2021
Property Inference from Poisoning.
IACR Cryptol. ePrint Arch., 2021
Aggregate Measurement via Oblivious Shuffling.
IACR Cryptol. ePrint Arch., 2021
Membership Inference on Word Embedding and Beyond.
CoRR, 2021
FastVer: Making Data Integrity a Commodity.
,
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the SIGMOD '21: International Conference on Management of Data, 2021
Efficient Graph Encryption Scheme for Shortest Path Queries.
Proceedings of the ASIA CCS '21: ACM Asia Conference on Computer and Communications Security, 2021
2019
IACR Cryptol. ePrint Arch., 2019
Oblivious PRF on Committed Vector Inputs and Application to Deduplication of Encrypted Data.
IACR Cryptol. ePrint Arch., 2019
SEEMless: Secure End-to-End Encrypted Messaging with less</> Trust.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019
2018
Integrity and Privacy in the Cloud: Efficient algorithms for secure and privacy-preserving processing of outsourced data.
PhD thesis, 2018
Privacy Preserving Verifiable Key Directories.
IACR Cryptol. ePrint Arch., 2018
2017
Stateful Multi-Client Verifiable Computation.
IACR Cryptol. ePrint Arch., 2017
2016
Efficient Verifiable Range and Closest Point Queries in Zero-Knowledge.
Proc. Priv. Enhancing Technol., 2016
Hash First, Argue Later: Adaptive Verifiable Computations on Outsourced Data.
IACR Cryptol. ePrint Arch., 2016
Verifiable Zero-Knowledge Order Queries and Updates for Fully Dynamic Lists and Trees.
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016
Zero-Knowledge Accumulators and Set Algebra.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016
2015
Authenticated Range \& Closest Point Queries in Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2015
Zero-Knowledge Accumulators and Set Operations.
IACR Cryptol. ePrint Arch., 2015
Fully-Dynamic Verifiable Zero-Knowledge Order Queries for Network Data.
IACR Cryptol. ePrint Arch., 2015
Faster Parameterized Algorithms for Deletion to Split Graphs.
Algorithmica, 2015
Zero-Knowledge Authenticated Order Queries and Order Statistics on a List.
Proceedings of the Applied Cryptography and Network Security, 2015
2014
Verifiable Member and Order Queries on a List in Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2014
2011
On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
CoRR, 2011
A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011