Using average case intractability in cryptography

Authors:
Candelaria Hernández Goya;Pino Caballero Gil
Affiliations:
Dept. Statistics, Operations Research and Computing, Universidad de La Laguna, La Laguna, Tenerife, Spain;Dept. Statistics, Operations Research and Computing, Universidad de La Laguna, La Laguna, Tenerife, Spain
Venue:
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
Year:
2004

Citing 8
Cited 0

Average case complete problems

SIAM Journal on Computing
Generalized linear threshold scheme

Proceedings of CRYPTO 84 on Advances in cryptology
Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Random instances of a graph coloring problem are hard

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Average case intractability of matrix and diophantine problems (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the theory of average case complexity

Journal of Computer and System Sciences
How to share a secret

Communications of the ACM
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Content delivery networks are overlay networks that reduce latency by placing a set of servers close to clients. It is specially effective for wide-area networks and the Internet, where network traffic may drive a user to wait for an unreasonable period ...