Sciweavers

849 search results - page 58 / 170
» Completely Non-malleable Schemes
Sort
View
CRYPTO
2004
Springer
162views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
We propose the first distributed discrete-log key generation (DLKG) protocol from scratch which is adaptively-secure in the non-erasure model, and at the same time completely avoi...
Masayuki Abe, Serge Fehr
115
Voted
CRYPTO
2001
Springer
113views Cryptology» more  CRYPTO 2001»
15 years 5 months ago
OAEP Reconsidered
The OAEP encryption scheme was introduced by Bellare and Rogaway at Eurocrypt ’94. It converts any trapdoor permutation scheme into a public-key encryption scheme. OAEP is widel...
Victor Shoup
ITIIS
2008
151views more  ITIIS 2008»
15 years 16 days ago
Bandwidth Management of WiMAX Systems and Performance Modeling
WiMAX has been introduced as a competitive alternative for metropolitan broadband wireless access technologies. It is connection oriented and it can provide very high data rates, ...
Yue Li, Jianhua He, Weixi Xing
112
Voted
CRYPTO
2011
Springer
245views Cryptology» more  CRYPTO 2011»
14 years 11 days ago
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
Zvika Brakerski, Vinod Vaikuntanathan
112
Voted
RTSS
1992
IEEE
15 years 4 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin