General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences
Towards 3-query locally decodable codes of subexponential length
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Secure coprocessor-based private information retrieval without periodical preprocessing
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
Reconstruction of falsified computer logs for digital forensics investigations
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
High-rate codes with sublinear-time decoding
Proceedings of the forty-third annual ACM symposium on Theory of computing
Adjusting the trade-off between privacy guarantees and computational cost in secure hardware PIR
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
SIAM Journal on Computing
Secure computation of constant-depth circuits with applications to database search problems
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences
A novel elementary construction of matching vectors
Information Processing Letters
| Hi-index | 0.00 |
We study the complexity of the isomorphism and automorphism problems for finite rings with unity. We show that both integer factorization and graph isomorphism reduce to the problem of counting automorphisms of rings. The problem is shown to be in the ...