Keisuke Tanaka - Citegraph

Author Info

Name	Affiliation	Papers
KEISUKE TANAKA	Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan	26
Collaborators	Citations	PageRank
24	278	19.04
Referers	Referees	References
514	419	417

Search Limit

100514

Publications (26 rows)

Collaborators (24 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Obfustopia Built on Secret-Key Functional Encryption	0	0.34	2022
General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction.	1	0.35	2017
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees	8	0.54	2013
A Multi-Trapdoor Commitment Scheme from the RSA Assumption.	0	0.34	2012
A Multi-trapdoor Commitment Scheme from the RSA Assumption	3	0.39	2012
An Efficient Non-interactive Universally Composable String-Commitment Scheme.	0	0.34	2012
Reduction-Centric Non-programmable Security Proof for the Full Domain Hash in the Random Oracle Model.	0	0.34	2012
Characterization of the relations between information-theoretic non-malleability, secrecy, and authenticity	6	0.56	2011
Information-Theoretic Secrecy With Access To Decryption Oracles	1	0.37	2011
Key Generation For Fast Inversion Of The Paillier Encryption Function	0	0.34	2010
A Rational Secret-Sharing Scheme Based On Rsa-Oaep	5	0.42	2010
CCA proxy re-encryption without bilinear maps in the standard model	32	1.04	2010
Security of encryption schemes in weakened random oracle models	4	0.38	2010
On the Weak Ideal Compression Functions	0	0.34	2009
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge	8	0.44	2009
On the Insecurity of the Fiat-Shamir Signatures with Iterative Hash Functions	0	0.34	2009
Efficient Non-interactive Universally Composable String-Commitment Schemes	16	0.63	2009
Efficient Public Key Encryption Based on Ideal Lattices	70	3.04	2009
Primitive Power Roots Of Unity And Its Application To Encryption	0	0.34	2009
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems	60	2.01	2008
Security of digital signature schemes in weakened random oracle models	13	0.55	2008
Public-Key Cryptosystems with Primitive Power Roots of Unity	1	0.35	2008
Multi-bit cryptosystems based on lattice problems	34	3.67	2007
Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem	8	0.66	2004
Quantum bit-commitment for small storage based on quantum one-way permutations	1	0.36	2003
An exponential gap with the removal of one negation gate	7	0.58	2002