Anh Ta
@anhta24.bsky.social
Mathematician by training. Geometry and Combinatorics. Machine Learning and Cryptography now.
https://scholar.google.com/citations?user=1y0vv1wAAAAJ&hl=en
https://scholar.google.com/citations?user=1y0vv1wAAAAJ&hl=en
We define a new cryptographic system to allow user to show that he has a valid certificate from a public set of authorities, while hiding all the message, signature and identity of the authority
April 30, 2025 at 1:06 AM
We define a new cryptographic system to allow user to show that he has a valid certificate from a public set of authorities, while hiding all the message, signature and identity of the authority
When using digital certificate, one usually gets signature from some authority, then show the message and signature for verification.
April 30, 2025 at 1:06 AM
When using digital certificate, one usually gets signature from some authority, then show the message and signature for verification.
Reposted by Anh Ta
KS studies the Matrix Multiplication Verification Problem (MMV), in which you get three n x n matrices A, B, C (say, with poly(n)-bounded integer entries) and want to decide whether AB = C. This is trivial to solve in MM time O(n^omega) deterministically: compute AB and compare it with C. 2/
February 21, 2025 at 4:50 AM
KS studies the Matrix Multiplication Verification Problem (MMV), in which you get three n x n matrices A, B, C (say, with poly(n)-bounded integer entries) and want to decide whether AB = C. This is trivial to solve in MM time O(n^omega) deterministically: compute AB and compare it with C. 2/