#### Filter Results:

- Full text PDF available (10)

#### Publication Year

2001

2017

- This year (3)
- Last 5 years (22)
- Last 10 years (31)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
- DPM/SETOP
- 2013

- Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Kazuhiro Yokoyama, Takeshi Koshiba
- CD-ARES Workshops
- 2013

The basic pattern matching problem is to find the locations where a pattern occurs in a text. Recently, secure pattern matching has been received much attention in various areas, including privacy-preserving DNA matching and secure biometric authentication. The aim of this paper is to give a practical solution for this problem using homomorphic encryption,… (More)

- Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda
- 2010 International Conference on Availability…
- 2010

The discrete logarithm problem (DLP) is one of the familiar problem on which cryptographic schemes rely. In 2006, Cheon proposed an algorithm for solving DLP with auxiliary input which works better than conventional algorithms. This paper firstly reports experimental results on Cheon's algorithm for DLP on a super singular elliptic curve defined over… (More)

- Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu
- Applicable Algebra in Engineering, Communication…
- 2016

The RSA cryptosystem and elliptic curve cryptography (ECC) have been used practically and widely in public key cryptography. The security of RSA and ECC respectively relies on the computational hardness of the integer factorization problem (IFP) and the elliptic curve discrete logarithm problem (ECDLP). In this paper, we give an estimate of computing power… (More)

- Avradip Mandal, Arnab Roy, Masaya Yasuda
- DPM/QASA@ESORICS
- 2015

- T. IKI, M. HORIGUCHI, M. YASUDA, M. KURANO
- 2007

Abstract. Based on temporal difference method in neuro-dynamic programming, an adaptive policy for finite state Markov decision processes with the average reward is constructed under the minorization condition. We estimate the value function by a learning iteration algorithm. And the adaptive policy is specified as an ε-forced modification of the greedy… (More)

- Yumi Sakemi, Goichiro Hanaoka, Tetsuya Izu, Masahiko Takenaka, Masaya Yasuda
- Public Key Cryptography
- 2012

A discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α from G, αG, αG in an additive cyclic group generated by an element G of prime order r, and a positive integer d satisfying d|(r − 1). The infeasibility of this problem assures the security of some cryptographic schemes. In 2006, Cheon proposed a novel algorithm for solving… (More)

- M. KURANO, M. YASUDA, J. NAKAGAMI
- 2001

In this paper, the uncertain transition matrices for inhomogeneous Markov decision processes are described by use of fuzzy sets. Introducing a ν-step contractive property, called a minorization condition, for the average case, we fined a Pareto optimal policy maximizing the average expected fuzzy rewards under some partial order. The Pareto optimal policies… (More)

- Masaya Yasuda, Takeshi Shimoyama, Jun Kogure, Tetsuya Izu
- SCN
- 2012