Learn More
  • Yuji Suga
  • 2013 Seventh International Conference on…
  • 2013
Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using only XOR operation at distribution and restoration processes. In these(More)
  • Yuji Suga
  • 2010 13th International Conference on Network…
  • 2010
In current content delivery service, contents are usually encrypted for access control mechanism, so several key distribution schemes have been proposed. In this paper, we propose a new key derivation scheme for hierarchy-based access control. We assume that content consumers are listed in digraph structure, and all nodes are assigned seeds(pre-keys) for(More)
  • Yuji Suga
  • 2013 16th International Conference on Network…
  • 2013
Fast (k, n)-threshold secret sharing schemes with exclusive-OR operations have proposed by Kurihara et al. and Fujii et al. independently. Their method are ideal that share size is equal to the size of the data to be distributed with the benefits that can be handled very fast for using only XOR operation at distribution and restoration processes. In these(More)
  • Yuji Suga
  • 2014 17th International Conference on Network…
  • 2014
This paper discusses forward secrecy functionality, which has come into the spotlight due to a series of news reports regarding the NSA. SSL/TLS server support for forward secrecy was introduced at major sites such as SNS at the end of last year, so servers enabling forward secrecy are increasing. This paper shows SSL/TLS servers status survey about(More)
  • Yuji Suga
  • 2012 26th International Conference on Advanced…
  • 2012
When using public key certificates and PGP keys as trust anchors, a common practice is to verify fingerprints obtained in two different channels by using the cryptographic hash function such as MD5 and SHA-1. This paper proposes several verifying methods with interaction rather than static verification methods and presents some issues.
  • Yuji Suga
  • 2011 Fifth International Conference on Innovative…
  • 2011
Visual secret sharing scheme (for short the VSS scheme) with access structure based on graph \cite{ABSS96} has been proposed and this can be considered as an extension of $(2, n) $-threshold VSS scheme. Ateniese et al. showed a decomposition method that we decompose star graphs from a given graph which edges are specified by qualified sets. Namely, two(More)
  • Yuji Suga
  • 2016 10th International Conference on Innovative…
  • 2016
A visual secret sharing scheme with an access structure based on a given graph has been proposed, and can be considered an extension of (2, n)-threshold visual secret sharing schemes. Ateniese et al. presented a decomposition method in which a dealer decomposes a given graph into star graphs, with qualified participants (vertices in a given graph) who have(More)
  • Yuji Suga
  • 2014 Eighth International Conference on…
  • 2014
In 2009, researchers released details of a vulnerability in the SSL and TLS protocols that could allow Man-in-the-Middle attacks to be carried out. IETF published countermeasures with unprecedented speed as RFC5746, however server-side implementations are not deployed because of problems in business such as the loss of opportunities and backward(More)