Sciweavers

64 search results - page 13 / 13
» Secure multi-party quantum computation
Sort
View
ASIACRYPT
2000
Springer
13 years 10 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
CRYPTO
2011
Springer
179views Cryptology» more  CRYPTO 2011»
12 years 6 months ago
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b2+o(1) with conjectured security level 2b against conventional computers and quantum computers. Th...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
ISHPC
1999
Springer
13 years 10 months ago
Integrity and Performance in Network Attached Storage
Computer security is of growing importance in the increasingly networked computing environment.This work examines the issue of high-performance network security, specifically int...
Howard Gobioff, David Nagle, Garth A. Gibson
SICHERHEIT
2008
13 years 7 months ago
Efficiency Improvement for NTRU
Abstract: The NTRU encryption scheme is an interesting alternative to well-established encryption schemes such as RSA, ElGamal, and ECIES. The security of NTRU relies on the hardne...
Johannes Buchmann, Martin Döring, Richard Lin...