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
Journal of Cryptology
Springer-Verlag New York, Inc.
  1-9 of 9 reviews Date Reviewed 
  Secret-sharing schemes for very dense graphs
Beimel A., Farràs O., Mintz Y.  Journal of Cryptology 29(2): 336-362, 2016. Type: Article

Secret-sharing schemes are common when it comes to distributing a secret among individual participants so as to ascertain that no individual has full knowledge of the secret at any given time. The paper presents an approach for maintaining small s...

Sep 14 2016
  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
  Spreading alerts quietly and the subgroup escape problem
Aspnes J., Diamadi Z., Yampolskiy A., Gjøsteen K., Peralta R.  Journal of Cryptology 28(4): 796-819, 2015. Type: Article

In intrusion detection, how to send alert messages without scaring the attacker in the very early state is a practical issue. The solutions for this problem vary. Sentinel nodes can send encrypted messages instead of plaintext, but for further sec...

Feb 9 2016
  Provably-secure time-bound hierarchical key assignment schemes
Ateniese G., De Santis A., Ferrara A., Masucci B.  Journal of Cryptology 25(2): 243-270, 2012. Type: Article

A hierarchical key assignment scheme is an algorithm for assigning cryptographic keys to users. Consider a set of users that needs to communicate securely. Using the assigned secret key and public information, a user should be able to compute the ...

Oct 1 2012
  A verifiable secret shuffle of homomorphic encryptions
Groth J.  Journal of Cryptology 23(4): 546-579, 2010. Type: Article

Groth proposes a shuffle-based scheme for an n-move honest verifier zero-knowledge (HVZK) argument, to shuffle known messages. The goal of this shuffle-based HVZK (SHVZK) scheme is to produce efficient HVZK arguments for the cor...

Mar 7 2011
  Cryptanalysis of ISO/IEC 9796-1
Coppersmith D., Coron J., Grieu F., Halevi S., Jutla C., Naccache D., Stern J.  Journal of Cryptology 21(1): 27-51, 2008. Type: Article

The ISO/IEC 9796-1 signature standard is the first international standard for digital signatures. This paper describes two different attacks against it. Each of the two attacks constitutes existential forgery under a chosen message attack: the att...

Jun 19 2008
  Instant ciphertext-only cryptanalysis of GSM encrypted communication
Barkan E., Biham E., Keller N.  Journal of Cryptology 21(3): 392-429, 2008. Type: Article

Global system for mobile communications (GSM) and general packet radio service (GPRS) use encryption and security protocols to protect the privacy and integrity of the data they transmit. In this paper, new methods for attacking this encryption an...

Jun 16 2008
  A one round protocol for tripartite Diffie–Hellman
Joux A.  Journal of Cryptology 17(4): 263-276, 2004. Type: Article

This paper describes a variant of the Diffie-Hellman protocol, generalized for three participants, and based on elliptic curves as the mathematical tool....

Jun 29 2005
  Hyperelliptic cryptosystems
Koblitz N. (ed)  Journal of Cryptology 1(3): 139-150, 1989. Type: Article

One of the general methods for constructing public key cryptosystems is based on the discrete logarithm problem in finite Abelian groups. The crucial problem in applying this method is to find large classes of groups where the discrete logarithm p...

Jul 1 1990
Display per column
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy