| |
 |
|
|
Xu, Guangwu
University of Wisconsin-Milwaukee
Milwaukee, Wisconsin
|
|
 |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 4 of 4
reviews
|
|
|
|
|
|
|
|
Asymptotically efficient lattice-based digital signatures
Lyubashevsky V., Micciancio D. Journal of Cryptology 31(3): 774-797, 2018. Type: Article
This paper proposes a general framework for designing a one-time signature scheme using “certain types of linear collision-resistant hash functions.” Using a standard transformation (for example, signatures based on...
|
Oct 2 2018 |
|
|
|
|
|
|
An almost optimal unrestricted fast Johnson-Lindenstrauss transform
Ailon N., Liberty E. ACM Transactions on Algorithms 9(3): 1-12, 2013. Type: Article
This paper deals with the randomized construction of efficiently computable Johnson-Lindenstrauss transforms. The paper greatly improves previous results in the literature by establishing an almost optimal result in terms of the dimens...
|
Oct 15 2013 |
|
|
|
|
|
|
For some eyes only: protecting online information sharing
Beato F., Ion I., Čapkun S., Preneel B., Langheinrich M. CODASPY 2013 (Proceedings of the 3rd ACM Conference on Data and Application Security and Privacy, San Antonio, TX, Feb 18-20, 2013) 1-12, 2013. Type: Proceedings
This paper addresses an interesting data security and privacy issue on online sharing platforms. The authors propose a carefully designed system with strong user-side encryption. A notable feature of this system is that the ciphertext ...
|
Jul 12 2013 |
|
|
|
|
|
|
On the distinctness of modular reductions of primitive sequences modulo square-free odd integers
Zheng Q., Qi W., Tian T. Information Processing Letters 112(22): 872-875, 2012. Type: Article
The study of maximal period linear recurring sequences, or primitive sequences, over ring ℤ/(M) (for some special positive integer M) is of cryptographic importance. In deriving a good ps...
|
May 10 2013 |
|
|
|
|
|
| |
|
|
| |
|
|
