Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Data (E) > Data Encryption (E.3) > Public Key Cryptosystems (E.3...)  
 
Options:
 
  1-10 of 115 Reviews about "Public Key Cryptosystems (E.3...)": Date Reviewed
  A generalized attack on RSA type cryptosystems
Bunder M., Nitaj A., Susilo W., Tonien J.  Theoretical Computer Science 704 74-81, 2017. Type: Article

The safety of the well-known RSA cryptosystem is based on the fact that, in general, it is computationally very hard to factorize large integers. Given two large prime numbers p and q, the public key is the pa...

Mar 23 2018
  Short signatures from Diffie-Hellman: realizing almost compact public key
Seo J.  Journal of Cryptology 30(3): 735-759, 2017. Type: Article

Seo proposes a size-reduced signature scheme, which applies the discrete logarithm principle (DLP) and relies on the computational Diffie-Hellman assumption (CDH) in the standard model. The author first introduces background knowledge, then presen...

Dec 21 2017
  Emergent computation: a festschrift for Selim G. Akl
Adamatzky A.,  Springer International Publishing, New York, NY, 2016. 643 pp. Type: Book (978-3-319463-75-9)

The foreword, by David Rappaport and Kai Salomaa, is a very nice summary (five pages) of significant contributions made by Selim G. Akl in several areas of informatics during the course of a very productive career. (For the sake of transparency: I...

Aug 8 2017
  Computational hardness of IFP and ECDLP
Yasuda M., Shimoyama T., Kogure J., Izu T.  Applicable Algebra in Engineering, Communication and Computing 27(6): 493-521, 2016. Type: Article

It is generally recognized that elliptic curve cryptography (ECC) can attain the same level of security as RSA with a shorter key length. This paper offers practical evidence of this claim. For both RSA and ECC, security depends on the intractabil...

Apr 6 2017
  Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares
Libert B., Joye M., Yung M.  Theoretical Computer Science 645(C): 1-24, 2016. Type: Article

Libert et al. develop a fully distributed, non-interactive, adaptively secure threshold signature scheme with scalable share size....

Jan 13 2017
  Tightly secure signatures from lossy identification schemes
Abdalla M., Fouque P., Lyubashevsky V., Tibouchi M.  Journal of Cryptology 29(3): 597-631, 2016. Type: Article

The authors have done a great job in presenting a potentially high-impact work. The paper studies signature schemes that are secure in the random oracle model, particularly those based on the Fiat-Shamir (heuristic) technique....

Sep 7 2016
  (Leveled) fully homomorphic encryption without bootstrapping
Brakerski Z., Gentry C., Vaikuntanathan V.  ACM Transactions on Computation Theory 6(3): Article No. 13, 2014. Type: Article

If you work with large amounts of data being hosted on public clouds, homomorphic encryption (HE) is an extremely innovative idea to add security layers to your data while it is being hosted and processed on third-party servers. Basically, HE allo...

Jul 24 2015
  Certification authorities under attack: a plea for certificate legitimation
Oppliger R.  IEEE Internet Computing 18(1): 40-47, 2014. Type: Article

The legitimacy of certification in public-key infrastructure (PKI) is crucial for Internet security. This article discusses recent attacks against certification authorities (CA), revealing two main issues: certificate revocation and certificate au...

May 5 2015
   A unified method for finding impossible differentials of block cipher structures
Luo Y., Lai X., Wu Z., Gong G.  Information Sciences 263211-220, 2014. Type: Article

Impossible differential analysis is widely used as a cryptographic tool for key recovering or distinguishing attacks on block ciphers. There are mainly two methods for searching impossible differentials: one is case-by-case analysis and the other ...

Nov 6 2014
  Black-box construction of a more than non-malleable CCA1 encryption scheme from plaintext awareness
Myers S., Sergi M., shelat a.  Journal of Computer Security 21(5): 721-748, 2013. Type: Article

Ways to construct cryptographic schemes to protect against malicious attackers have received a great deal of attention in the area of formally provable security, in both academia and industry. It is very difficult to define new formal security mod...

Oct 6 2014
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2018 ThinkLoud, Inc.
Terms of Use
| Privacy Policy