Login / Signup
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems.
Akinori Kawachi
Keisuke Tanaka
Keita Xagawa
Published in:
ASIACRYPT (2008)
Keyphrases
</>
worst case
np hard
np complete
search algorithm
lower bound
problems involving
neural network
special case
upper bound
lightweight
error bounds
phase transition
key management
complexity bounds