Tatsuaki Okamoto

International Association for Cryptologic Research

Tatsuaki Okamoto Search web for home page

Program Committees

1	2013	PKC	pc
2	2013	TCC	general chair
3	2012	Asiacrypt	pc
4	2012	Crypto	pc
5	2011	Eurocrypt	pc
6	2010	Eurocrypt	pc
7	2008	TCC	pc
8	2008	Asiacrypt	pc
9	2007	PKC	pc chair
10	2005	Eurocrypt	pc
11	2005	PKC	pc
12	2004	Crypto	pc
13	2003	Crypto	pc
14	2003	PKC	pc
15	2002	Crypto	pc
16	2001	Crypto	pc
17	2001	PKC	pc
18	2000	PKC	pc
19	2000	Asiacrypt	pc chair
20	1999	PKC	pc
21	1998	PKC	pc
22	1997	Crypto	pc
23	1996	Eurocrypt	pc
24	1994	Eurocrypt	pc
25	1994	Asiacrypt	pc
26	1993	Crypto	pc
27	1992	Eurocrypt	pc

Publications

	year	title	booktitle	pages
1	2012	Fully Secure Unbounded Inner-Product and Attribute-Based Encryption	asiacrypt	349-366
2	2012	Adaptively Attribute-Hiding (Hierarchical) Inner Product Encryption	eurocrypt	591-608
3	2011	Efficient Attribute-Based Signatures for Non-Monotone Predicates in the Standard Model	pkc	35
4	2010	Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption	crypto	191-208
5	2010	Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption	eurocrypt	62-91
6	2010	Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption	eprint	online
7	2009	Compact CCA-Secure Encryption for Messages of Arbitrary Length	pkc	377-392
8	2009	Hierarchical Predicate Encryption for Inner-Products	asiacrypt	214-231
9	2008	Chosen Ciphertext Security with Optimal Ciphertext Overhead	asiacrypt	355-371
10	2007	Authenticated Key Exchange and Key Encapsulation in the Standard Model	asiacrypt	474-484
11	2007	Authenticated Key Exchange and Key Encapsulation Without Random Oracles	eprint	online
12	2006	On the Equivalence of Several Security Notions of Key Encapsulation Mechanism	eprint	online
13	2006	Efficient Blind and Partially Blind Signatures Without Random Oracles	tcc	online
14	2006	Efficient Blind and Partially Blind Signatures Without Random Oracles	eprint	online
15	2005	A Universally Composable Secure Channel Based on the KEM-DEM Framework	tcc	online
16	2004	RSA-OAEP Is Secure under the RSA Assumption	jofc	81-104
17	2004	An RSA Family of Trap-Door Permutations with a Common Domain and Its Applications	pkc	online
18	2003	Almost Uniform Density of Power Residues and the Provable Security of ESIGN	asiacrypt	online
19	2003	Resource Bounded Unprovability of Computational Lower Bounds	eprint	online
20	2001	RSA-OAEP Is Secure under the RSA Assumption	crypto	260-274
21	2001	The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes	pkc	104-118
22	2000	Quantum Public-Key Cryptosystems	crypto	147-165
23	2000	RSA-OAEP is Secure under the RSA Assumption	eprint	online
24	2000	Provably Secure Partially Blind Signatures	crypto	271-286
25	1999	How to Enhance the Security of Public-Key Encryption at Minimum Cost	pkc	53-68
26	1999	Secure Integration of Asymmetric and Symmetric Encryption Schemes	crypto	537-554
27	1999	A Signature Scheme with Message Recovery as Secure as Discrete Logarithm	asiacrypt	378-389
28	1998	On Concrete Security Treatment of Signatures Derived from Identification	crypto	354-369
29	1998	A New Public-Key Cryptosystem as Secure as Factoring	eurocrypt	308-318
30	1998	Security of an Identity-Based Cryptosystem and the Related Reductions	eurocrypt	546-560
31	1998	Lower Bounds on Term-Based Divisible Cash Systems	pkc	72-82
32	1998	A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications	eurocrypt	32-46
33	1997	Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations	crypto	16-30
34	1997	Keeping the SZK-Verifier Honest Unconditionally	crypto	31-45
35	1995	An Efficient Divisible Electronic Cash Scheme	crypto	438-451
36	1995	Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs	crypto	325-338
37	1994	Single-Term Divisible Electronic Coins	eurocrypt	306-319
38	1994	Designated Confirmer Signatures and Public-Key Encryption are Equivalent	crypto	61-74
39	1994	Zero-Knowledge Proofs af Computational Power in the Shared String Model	asiacrypt	182-192
40	1993	On Key Distribution and Authentication in Mobile Radio Networks	eurocrypt	461-465
41	1992	Secure Bit Commitment Function against Divertibility	eurocrypt	324-340
42	1992	Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes	crypto	31-53
43	1992	An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Z_n	crypto	54-65
44	1992	How Intractable Is the Discrete Logarithm for a General Finite Group?	eurocrypt	420-428
45	1992	A Practical Secret Voting Scheme for Large Scale Elections	auscrypt	244-251
46	1991	A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme	asiacrypt	139-148
47	1991	An Extensin of Zero-Knowledge Proofs and Its Applications	asiacrypt	368-381
48	1991	Direct Zero Knowledge Proofs of Computational Power in Five Rounds	eurocrypt	96-105
49	1991	Universal Electronic Cash	crypto	324-337
50	1991	Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems	crypto	267-278
51	1991	New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n	crypto	252-266
52	1991	ESIGN: An Efficient Digital Signature Implementation for Smard Cards	eurocrypt	446-457
53	1991	Interactive Bi-Proof Systems and Undeniable Signature Schemes	eurocrypt	243-256
54	1990	Membership Authentication for Hierarchical Multigroups Using the Extended Fiat-Shamir Scheme	eurocrypt	446-457
55	1990	How to Utilize the Randomness of Zero-Knowledge Proofs	crypto	456-475
56	1989	Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility	eurocrypt	134-148
57	1989	Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash	crypto	481-496
58	1988	A Modification of the Fiat-Shamir Scheme	crypto	232-243

Tatsuaki Okamoto Search web for home page

Program Committees

Publications

Coauthors of Tatsuaki Okamoto