Sciweavers

70 search results - page 12 / 14
» Combinatorial Group Theory and Public Key Cryptography
Sort
View
STACS
2010
Springer
15 years 4 months ago
Mathematics, Cryptology, Security
Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diffie and H...
Jacques Stern
ASIACRYPT
2000
Springer
15 years 1 months ago
Strengthening McEliece Cryptosystem
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present...
Pierre Loidreau
CRYPTO
2009
Springer
154views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
Vadim Lyubashevsky, Daniele Micciancio
CODASPY
2012
13 years 5 months ago
Comparison-based encryption for fine-grained access control in clouds
Access control is one of the most important security mechanisms in cloud computing. However, there has been little work that explores various comparison-based constraints for regu...
Yan Zhu, Hongxin Hu, Gail-Joon Ahn, Mengyang Yu, H...
73
Voted
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 2 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith