Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Satoshi Hada

dblp:98/2137 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 3 first-authorSoftware engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
5 papers
Authentication and access control · 35% Cryptographic primitives and cryptanalysis · 35% Cryptographic protocols and secure computation · 22%
Databases, data mining, and information retrieval
2 papers
Query processing and optimization · 84% Data models and query languages · 16%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
obfuscation
0.112010
Secure Obfuscation for Encrypted Signatures · EUROCRYPT 2010
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.022000
Zero-Knowledge and Code Obfuscation · ASIACRYPT 2000
On the Existence of 3-Round Zero-Knowledge Protocols · CRYPTO 1998
Query processing and optimization
query optimization
0.012003
XML access control using static analysis · CCS 2003
Authentication and access control › access control policy
access control policy enforcement
0.012003
XML access control using static analysis · CCS 2003
Authentication and access control › access control › data access control
XML access control
0.012003
XML access control using static analysis · CCS 2003
Program analysis
static analysis
0.012003
XML access control using static analysis · CCS 2003
Authentication and access control
authorization
0.012000
XML document security based on provisional authorization · CCS 2000
Systems and software security › software protection
code obfuscation
0.012000
Zero-Knowledge and Code Obfuscation · ASIACRYPT 2000
Cryptographic protocols and secure computation › secure multiparty computation
round complexity
0.011998
On the Existence of 3-Round Zero-Knowledge Protocols · CRYPTO 1998
Data models and query languages
XML data management
0.012000
XML document security based on provisional authorization · CCS 2000

Methods — techniques the papers use, named apart from their topics

static analysis · 0.1XQuery · 0.1XPath · 0.1provisional authorization · 0.1
YearPublicationVenuePosition
2010 Secure Obfuscation for Encrypted Signatures
Satoshi Hada
EUROCRYPT1
2009 Static vs. Dynamic Validation of BSP Conformance
abstract
WS-I's basic security profile (BSP) defines best practice guidelines for secure Web services communications, enabling interoperability between vendors. However it is difficult for developers to know if their SOA solutions are in fact compliant to these guidelines. In this paper, we discuss methods to assess compliance against BSP. We have implemented runtime validation of SOAP messages to check for compliance against BSP, a method implied by the BSP definition itself. Additionally, we have implemented a novel approach to statically validate WS security policies against BSP using Schematron. From our experiments dynamic validation for BSP compliance offers greater coverage but results in a significant overhead, while static validation is limited in its scope but extremely valuable since under reasonable assumptions it provides assurances about compliance prior to deployment. We conclude with a summation of our results and lessons for SOA practitioners.
Stefan Prennschütz-Schützenau, Nirmal Mukhi, Satoshi Hada, Naoto Sato, Fumiko Satoh, Naohiko Uramoto
ICWS3
2006 XML access control using static analysis
abstract
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access-control policies. However such access-control policies are burdens to the query engines for XML documents. To relieve this burden, we introduce static analysis for XML access-control. Given an access-control policy, query expression, and an optional schema, static analysis determines if this query expression is guaranteed not to access elements or attributes that are hidden by the access-control policy but permitted by the schema. Static analysis can be performed without evaluating any query expression against actual XML documents. Run-time checking is required only when static analysis is unable to determine whether to grant or deny access requests. A side effect of static analysis is query optimization: access-denied expressions in queries can be evaluated to empty lists at compile time. We further extend static analysis for handling value-based access-control policies and introduce view schemas.
Makoto Murata, Akihiko Tozawa, Michiharu Kudo, Satoshi Hada
ACM Trans. Inf. Syst. Secur.4
2003 XML access control using static analysis
abstract
Access control policies for XML typically use regular path expressions such as XPath for specifying the objects for access control policies. However such access control policies are burdens to the engines for XML query languages. To relieve this burden, we introduce static analysis for XML access control. Given an access control policy, query expression, and an optional schema, static analysis determines if this query expression is guaranteed not to access elements or attributes that are permitted by the schema but hidden by the access control policy. Static analysis can be performed without evaluating any query expression against an actual database. Run-time checking is required only when static analysis is unable to determine whether to grant or deny access requests. A nice side-effect of static analysis is query optimization: access-denied expressions in queries can be evaluated to empty lists at compile time. We have built a prototype of static analysis for XQuery, and shown the effectiveness and scalability through experiments.
Makoto Murata, Akihiko Tozawa, Michiharu Kudo, Satoshi Hada
CCS4
2000 Zero-Knowledge and Code Obfuscation
Satoshi Hada
ASIACRYPT1
2000 XML document security based on provisional authorization
Michiharu Kudo, Satoshi Hada
CCS2
1998 On the Existence of 3-Round Zero-Knowledge Protocols
Satoshi Hada, Toshiaki Tanaka
CRYPTO1