Search Results - "Shizuya, Hiroki"

A formalization of card-based cryptographic protocols via abstract machine by Mizuki, Takaaki, Shizuya, Hiroki

“…Consider a face-down card lying on the table such that we do not know whether its suit color is black or red. Then, how do we make identical copies of the card…”
Get full text

On the pseudo-freeness and the CDH assumption by Hasegawa, Shingo, Isobe, Shuji, Shizuya, Hiroki, Tashiro, Katsuhiro

“…The notion of pseudo-free group was first introduced by Hohenberger (Master’s thesis, EECS Dept., MIT, 2003). Rivest (TCC 2004. LNCS 2951 , 505–521, 2004)…”
Get full text

Characterization of optimal key set protocols by Mizuki, Takaaki, Shizuya, Hiroki, Nishizeki, Takao

“…Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a common one-bit secret key which is…”
Get full text

A structural comparison of the computational difficulty of breaking discrete log cryptosystems by SAKURAI, K, SHIZUYA, H

“…The complexity of breaking cryptosystems of which security is based on the discrete logarithm problem is explored. The cryptosystems mainly discussed are the…”
Get full text

Divertible and subliminal-free zero-knowledge proofs for languages by BURMESTER, M, DESMEDT, Y. G, ITOH, T, SAKURAI, K, SHIZUYA, H

“…Divertible proofs are extensions of interactive proofs in which an active eavesdropper, the warden, makes the prover and the verifier untraceable. The warden…”
Get full text

A language-dependent cryptographic primitive by ITOH, T, OHTA, Y, SHIZUYA, H

Get full text

Public-key Projective Arithmetic Functional Encryption by Hasegawa, Shingo, Hisai, Masashi, Shizuya, Hiroki

“…Ananth and Sahai proposed the projective arithmetic functional encryption (PAFE) and showed that PAFE derives a single-key selective secure functional…”
Get full text

A construction of attribute-based aggregate signatures by Hasegawa, Shingo, Isobe, Shuji, Koizumi, Eisuke, Shizuya, Hiroki, Takahashi, Ryo

“…For the identity-based aggregate signatures, Hohenberger, Sahai and Waters proposed the first scheme that admits unrestricted aggregation, using multilinear…”
Get full text

A complete characterization of a family of key exchange protocols by Mizuki, Takaaki, Shizuya, Hiroki, Nishizeki, Takao

“…Using a random deal of cards to players and a computationally unlimited eavesdropper, all players wish to share a one-bit secret key which is…”
Get full text

A language-dependent cryptographic primitive by Itoh Toshiya, Ohta Yuji, Shizuya Hiroki

“…In this paper we provide a new cryptographic primitive that generalizes several existing zero-knowledge proofs and show that if a languageL induces the…”
Get full text

Password-protected secret-sharing schemes without random oracles by Hasegawa, Shingo, Isobe, Shuji, Iwazaki, Jun-ya, Koizumi, Eisuke, Shizuya, Hiroki

“…We propose a password-protected secret sharing scheme which is provably secure without the random oracles. Three tools enable us to achieve this property: the…”
Get full text

Sharing secret keys along a Eulerian circuit by Mizuki, Takaaki, Shizuya, Hiroki, Nishizeki, Takao

“…A method for sharing secret keys that is information‐theoretically secure is an important problem in the area of cryptography. By randomly distributing cards…”
Get full text