Kaoru Kurosawa

According to our database1, Kaoru Kurosawa authored at least 250 papers between 1986 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
No-Dictionary Searchable Symmetric Encryption.
IEICE Transactions, 2019

CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (not $\mathtt{q}$-type) Assumptions.
IACR Cryptology ePrint Archive, 2019

How to Correct Errors in Multi-Server PIR.
IACR Cryptology ePrint Archive, 2019

CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not \mathtt q -type) Assumptions.
Proceedings of the Advances in Information and Computer Security, 2019

How to Solve Multiple Short-Exponent Discrete Logarithm Problem.
Proceedings of the Advances in Information and Computer Security, 2019

2018
(Short Paper) How to Solve DLOG Problem with Auxiliary Input.
Proceedings of the Advances in Information and Computer Security, 2018

How to Prove KDM Security of BHHO.
Proceedings of the Advances in Information and Computer Security, 2018

2017
IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions.
IJACT, 2017

Oblivious Polynomial Evaluation in the Exponent, Revisited.
IEICE Transactions, 2017

Anonymous and leakage resilient IBE and IPE.
Des. Codes Cryptogr., 2017

How to make a linear network code (strongly) secure.
Des. Codes Cryptogr., 2017

Efficient No-dictionary Verifiable Searchable Symmetric Encryption.
Proceedings of the Financial Cryptography and Data Security, 2017

More Efficient Construction of Bounded KDM Secure Encryption.
Proceedings of the Applied Cryptography and Network Security, 2017

2016
Efficient No-dictionary Verifiable SSE.
IACR Cryptology ePrint Archive, 2016

UC-Secure Dynamic Searchable Symmetric Encryption Scheme.
Proceedings of the Advances in Information and Computer Security, 2016

2015
Improved reconstruction of RSA private-keys from their fraction.
Inf. Process. Lett., 2015

Generic Fully Simulatable Adaptive Oblivious Transfer.
IEICE Transactions, 2015

How to Construct UC-Secure Searchable Symmetric Encryption Scheme.
IACR Cryptology ePrint Archive, 2015

(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

A Simple and Improved Algorithm for Integer Factorization with Implicit Hints.
Proceedings of the Topics in Cryptology, 2015

IBE Under k k -LIN with Shorter Ciphertexts and Private Keys.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014
Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions.
IEICE Transactions, 2014

(Batch) Fully Homomorphic Encryption over Integers for Non-Binary Message Spaces.
IACR Cryptology ePrint Archive, 2014

A Simple and Improved Algorithm for Integer Factorization with Implicit Hints.
IACR Cryptology ePrint Archive, 2014

Garbled Searchable Symmetric Encryption.
Proceedings of the Financial Cryptography and Data Security, 2014

2-Pass Key Exchange Protocols from CPA-Secure KEM.
Proceedings of the Topics in Cryptology - CT-RSA 2014, 2014

Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013
New leakage-resilient CCA-secure public key encryption.
J. Mathematical Cryptology, 2013

How to Factor N1 and N2 When p1=p2 mod 2t.
IACR Cryptology ePrint Archive, 2013

Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited.
IACR Cryptology ePrint Archive, 2013

UC-Secure Multi-Session OT Using Tamper-Proof Hardware.
IACR Cryptology ePrint Archive, 2013

How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$.
Proceedings of the Advances in Information and Computer Security, 2013

How to Construct Strongly Secure Network Coding Scheme.
Proceedings of the Information Theoretic Security - 7th International Conference, 2013

How to Update Documents Verifiably in Searchable Symmetric Encryption.
Proceedings of the Cryptology and Network Security - 12th International Conference, 2013

Leakage Resilient IBE and IPE under the DLIN Assumption.
Proceedings of the Applied Cryptography and Network Security, 2013

2012
Undeniable and Unpretendable Signatures.
IEICE Transactions, 2012

New Leakage Resilient CCA-Secure Public Key Encryption.
IACR Cryptology ePrint Archive, 2012

Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions.
IACR Cryptology ePrint Archive, 2012

Round-efficient perfectly secure message transmission scheme against general adversary.
Des. Codes Cryptogr., 2012

UC-Secure Searchable Symmetric Encryption.
Proceedings of the Financial Cryptography and Data Security, 2012

Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions.
Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

2011
Hybrid Encryption.
Proceedings of the Encyclopedia of Cryptography and Security, 2nd Ed., 2011

General Error Decodable Secret Sharing Scheme and Its Application.
IEEE Trans. Information Theory, 2011

How to Shorten a Ciphertext of Reproducible Key Encapsulation Mechanisms in the Random Oracle Model.
IEICE Transactions, 2011

Maximum Leakage Resilient IBE and IPE.
IACR Cryptology ePrint Archive, 2011

Generic Fully Simulatable Adaptive Oblivious Transfer.
IACR Cryptology ePrint Archive, 2011

Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
IACR Cryptology ePrint Archive, 2011

The Round Complexity of Perfectly Secure General VSS.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

Generic Fully Simulatable Adaptive Oblivious Transfer.
Proceedings of the Applied Cryptography and Network Security, 2011

Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
Proceedings of the Applied Cryptography and Network Security, 2011

2010
Power of a public random permutation and its application to authenticated encryption.
IEEE Trans. Information Theory, 2010

A New and Improved Paradigm for Hybrid Encryption Secure Against Chosen-Ciphertext Attack.
J. Cryptology, 2010

New RSA-Based (Selectively) Convertible Undeniable Signature Schemes.
IEICE Transactions, 2010

Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption.
IEICE Transactions, 2010

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption.
IACR Cryptology ePrint Archive, 2010

Round-Efficient Perfectly Secure Message Transmission Scheme Against General Adversary.
IACR Cryptology ePrint Archive, 2010

Between Hashed DH and Computational DH: Compact Encryption from Weaker Assumption.
IACR Cryptology ePrint Archive, 2010

The Round Complexity of General VSS.
IACR Cryptology ePrint Archive, 2010

Provably Secure Convertible Undeniable Signatures with Unambiguity.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Efficiency-Improved Fully Simulatable Adaptive OT under the DDH Assumption.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

A Generic Method for Reducing Ciphertext Length of Reproducible KEMs in the RO Model.
Proceedings of the Advances in Information and Computer Security, 2010

Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk).
Proceedings of the Cryptology and Network Security - 9th International Conference, 2010

2009
One-wayness equivalent to general factoring.
IEEE Trans. Information Theory, 2009

Truly efficient 2-round perfectly secure message transmission scheme.
IEEE Trans. Information Theory, 2009

Almost Secure (1-Round, n-Channel) Message Transmission Scheme.
IEICE Transactions, 2009

Small Secret Key Attack on a Takagi's Variant of RSA.
IEICE Transactions, 2009

Tag-KEM from Set Partial Domain One-Way Permutations.
IEICE Transactions, 2009

Provably Secure Convertible Undeniable Signatures with Unambiguity.
IACR Cryptology ePrint Archive, 2009

Simple Adaptive Oblivious Transfer Without Random Oracle.
IACR Cryptology ePrint Archive, 2009

General Error Decodable Secret Sharing Scheme and Its Application.
IACR Cryptology ePrint Archive, 2009

Simple Adaptive Oblivious Transfer without Random Oracle.
Proceedings of the Advances in Cryptology, 2009

New RSA-Based (Selectively) Convertible Undeniable Signature Schemes.
Proceedings of the Progress in Cryptology, 2009

2008
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions.
IEEE Trans. Information Theory, 2008

Tag-KEM/DEM: A New Framework for Hybrid Encryption.
J. Cryptology, 2008

The power of identification schemes.
IJACT, 2008

Birthday Paradox for Multi-Collisions.
IEICE Transactions, 2008

Deterministic Polynomial Time Equivalence between Factoring and Key-Recovery Attack on Takagi's RSA.
IEICE Transactions, 2008

Security of the Five-Round Kasumi Type Permutation.
IEICE Transactions, 2008

Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.
IACR Cryptology ePrint Archive, 2008

Universally Composable Undeniable Signature.
IACR Cryptology ePrint Archive, 2008

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption.
IACR Cryptology ePrint Archive, 2008

A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Simple Direct Reduction of String (1, 2)-OT to Rabin's OT without Privacy Amplification.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

Universally Composable Undeniable Signature.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.
Proceedings of the Advances in Cryptology, 2008

Small Secret Key Attack on a Variant of RSA (Due to Takagi).
Proceedings of the Topics in Cryptology, 2008

Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption.
Proceedings of the Advances in Cryptology, 2008

2007
Immunity against Correlation Attack on Quantum Stream Cipher by Yuen 2000 Protocol.
Quantum Information Processing, 2007

How to Construct Super-Pseudorandom Permutations with Short Keys.
IEICE Transactions, 2007

How To Find Many Collisions of 3-Pass HAVAL.
IACR Cryptology ePrint Archive, 2007

Almost Secure (1-Round, n-Channel) Message Transmission Scheme.
IACR Cryptology ePrint Archive, 2007

How to Derive Lower Bound on Oblivious Transfer Reduction.
IACR Cryptology ePrint Archive, 2007

Direct Reduction of String (1, 2)-OT to Rabin's OT.
IACR Cryptology ePrint Archive, 2007

Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA.
Proceedings of the Public Key Cryptography, 2007

How to Find Many Collisions of 3-Pass HAVAL.
Proceedings of the Advances in Information and Computer Security, 2007

A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring.
Proceedings of the Information Security, 10th International Conference, 2007

Almost Secure (1-Round, n-Channel) Message Transmission Scheme.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

2006
The security of the FDH variant of Chaum's undeniable signature scheme.
IEEE Trans. Information Theory, 2006

Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography.
IEEE Trans. Information Theory, 2006

Optimum Secret Sharing Scheme Secure against Cheating.
SIAM J. Discrete Math., 2006

Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security.
Int. J. Inf. Sec., 2006

k-Resilient Identity-Based Encryption in the Standard Model.
IEICE Transactions, 2006

Relations Among Security Notions for Undeniable Signature Schemes.
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

New Online/Offline Signature Schemes Without Random Oracles.
Proceedings of the Public Key Cryptography, 2006

The Power of Identification Schemes.
Proceedings of the Public Key Cryptography, 2006

Bandwidth Optimal Steganography Secure Against Adaptive Chosen Stegotext Attacks.
Proceedings of the Information Hiding, 8th International Workshop, 2006

Birthday Paradox for Multi-collisions.
Proceedings of the Information Security and Cryptology - ICISC 2006, 9th International Conference, Busan, Korea, November 30, 2006

An Efficient Compiler from Sigma-Protocol to 2-Move Deniable Zero-Knowledge.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

New Approach for Selectively Convertible Undeniable Signature Schemes.
Proceedings of the Advances in Cryptology, 2006

Tag-KEM from Set Partial Domain One-Way Permutations.
Proceedings of the Information Security and Privacy, 11th Australasian Conference, 2006

2005
A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem.
J. UCS, 2005

A Scheme for Partial Disclosure of Transaction Log.
IEICE Transactions, 2005

How to Improve Interpolation Attack.
IEICE Transactions, 2005

A Network Game Based on Fair Random Numbers.
IEICE Transactions, 2005

On the Security of a MAC by Mitchell.
IEICE Transactions, 2005

A Provably Secure and Efficient Verifiable Shuffle based on a Variant of the Paillier Cryptosystem.
IACR Cryptology ePrint Archive, 2005

Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography.
IACR Cryptology ePrint Archive, 2005

One-Wayness Equivalent to General Factoring.
IACR Cryptology ePrint Archive, 2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption.
IACR Cryptology ePrint Archive, 2005

Primal-dual distance bounds of linear codes with application to cryptography
CoRR, 2005

The Security of the FDH Variant of Chaum's Undeniable Signature Scheme.
Proceedings of the Public Key Cryptography, 2005

Electronic Voting: Starting Over?
Proceedings of the Information Security, 8th International Conference, 2005

Some topics related to resilient functions.
Proceedings of the IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005

Identity-Based Identification Without Random Oracles.
Proceedings of the Computational Science and Its Applications, 2005

How to Enhance the Security of the 3GPP Confidentiality and Integrity Algorithms.
Proceedings of the Fast Software Encryption: 12th International Workshop, 2005

3-Move Undeniable Signature Scheme.
Proceedings of the Advances in Cryptology, 2005

Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM.
Proceedings of the Advances in Cryptology, 2005

2004
Almost security of cryptographic Boolean functions.
IEEE Trans. Information Theory, 2004

New covering radius of Reed-Muller codes for t-resilient functions.
IEEE Trans. Information Theory, 2004

Oblivious keyword search.
J. Complexity, 2004

On Parallel Hash Functions Based on Block-Ciphers.
IEICE Transactions, 2004

TMAC: Two-Key CBC MAC.
IEICE Transactions, 2004

How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer.
IEICE Transactions, 2004

On the Universal Hash Functions in Luby-Rackoff Cipher.
IEICE Transactions, 2004

Square Hash with a Small Key Size.
IEICE Transactions, 2004

The Security of the FDH Variant of Chaum's Undeniable Signature Scheme.
IACR Cryptology ePrint Archive, 2004

Almost Ideal Contrast Visual Cryptography with Reversing.
IACR Cryptology ePrint Archive, 2004

New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Discrete Mathematics, 2004

From Digital Signature to ID-based Identification/Signature.
Proceedings of the Public Key Cryptography, 2004

Short Exponent Diffie-Hellman Problems.
Proceedings of the Public Key Cryptography, 2004

Almost Ideal Contrast Visual Cryptography with Reversing.
Proceedings of the Topics in Cryptology, 2004

k-Resilient Identity-Based Encryption in the Standard Model.
Proceedings of the Topics in Cryptology, 2004

A New Paradigm of Hybrid Encryption Scheme.
Proceedings of the Advances in Cryptology, 2004

Verifiable Shuffles: A Formal Model and a Paillier-Based Efficient Construction with Provable Security.
Proceedings of the Applied Cryptography and Network Security, 2004

How to Remove MAC from DHIES.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

How to Re-use Round Function in Super-Pseudorandom Permutation.
Proceedings of the Information Security and Privacy: 9th Australasian Conference, 2004

2003
Non-cryptographic primitive for pseudorandom permutation.
Theor. Comput. Sci., 2003

Efficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks.
IACR Cryptology ePrint Archive, 2003

Some RSA-based Encryption Schemes with Tight Security Reduction.
IACR Cryptology ePrint Archive, 2003

Almost Security of Cryptographic Boolean Functions.
IACR Cryptology ePrint Archive, 2003

On the Pseudorandomness of KASUMI Type Permutations.
IACR Cryptology ePrint Archive, 2003

Stronger Security Bounds for OMAC, TMAC and XCBC.
IACR Cryptology ePrint Archive, 2003

Error Correcting and Complexity Aspects of Linear Secret Sharing Schemes.
Proceedings of the Information Security, 6th International Conference, 2003

Stronger Security Bounds for OMAC, TMAC, and XCBC.
Proceedings of the Progress in Cryptology, 2003

On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms.
Proceedings of the Cryptography and Coding, 2003

On the Security of a New Variant of OMAC.
Proceedings of the Information Security and Cryptology, 2003

OMAC: One-Key CBC MAC.
Proceedings of the Fast Software Encryption, 10th International Workshop, 2003

TMAC: Two-Key CBC MAC.
Proceedings of the Topics in Cryptology, 2003

Some RSA-Based Encryption Schemes with Tight Security Reduction.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

A Complete and Explicit Security Reduction Algorithm for RSA-Based Cryptosystems.
Proceedings of the Advances in Cryptology - ASIACRYPT 2003, 9th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, November 30, 2003

On Parallel Hash Functions Based on Block-Cipher.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

On the Pseudorandomness of KASUMI Type Permutations.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

Square Hash with a Small Key Size.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

2002
Oblivious Keyword Search.
IACR Cryptology ePrint Archive, 2002

Bit-Slice Auction Circuit.
IACR Cryptology ePrint Archive, 2002

New covering radius of Reed-Muller codes for t-resilient functions.
IACR Cryptology ePrint Archive, 2002

TMAC: Two-Key CBC MAC.
IACR Cryptology ePrint Archive, 2002

Power of a Public Random Permutation and its Application to Authenticated-Encryption.
IACR Cryptology ePrint Archive, 2002

OMAC: One-Key CBC MAC.
IACR Cryptology ePrint Archive, 2002

On the bound for anonymous secret sharing schemes.
Discrete Applied Mathematics, 2002

Linear Code Implies Public-Key Traitor Tracing.
Proceedings of the Public Key Cryptography, 2002

Multi-recipient Public-Key Encryption with Shortened Ciphertext.
Proceedings of the Public Key Cryptography, 2002

On the Universal Hash Functionsin Luby-Rackoff Cipher.
Proceedings of the Information Security and Cryptology, 2002

Non-cryptographic Primitive for Pseudorandom Permutation.
Proceedings of the Fast Software Encryption, 9th International Workshop, 2002

Bit-Slice Auction Circuit.
Proceedings of the Computer Security, 2002

Bounds for Robust Metering Schemes and Their Relationship with A-code.
Proceedings of the Advances in Cryptology, 2002

2001
Almost k-Wise Independent Sample Spaces and Their Cryptologic Applications.
J. Cryptology, 2001

Linear Code Implies Public-Key Traitor Tracing.
IACR Cryptology ePrint Archive, 2001

Multi-Recipient Public-Key Encryption with Shortened Ciphertext.
IACR Cryptology ePrint Archive, 2001

Bounds and Combinatorial Structure of Multi-Receiver-Codes.
Des. Codes Cryptogr., 2001

Combinatorial Bounds on Authentication Codes with Arbitration.
Des. Codes Cryptogr., 2001

New Covering Radius of Reed-Muller Codes for t-Resilient Functions.
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

IND-CCA Public Key Schemes Equivalent to Factoring n=pq.
Proceedings of the Public Key Cryptography, 2001

Generic Algorithms and Key Agreement Protocols Based on Group Actions.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Round Security and Super-Pseudorandomness of MISTY Type Structure.
Proceedings of the Fast Software Encryption, 8th International Workshop, 2001

2000
MDS secret-sharing scheme secure against cheaters.
IEEE Trans. Information Theory, 2000

A relationship between linear complexity and kapa-error linear complexity.
IEEE Trans. Information Theory, 2000

How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes.
IACR Cryptology ePrint Archive, 2000

Combinatorial Classification of Optimal Authentication Codes with Arbitration.
Des. Codes Cryptogr., 2000

Root Finding Interpolation Attack.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000

On the Pseudorandomness of the AES Finalists - RC6 and Serpent.
Proceedings of the Fast Software Encryption, 7th International Workshop, 2000

How to Break a Practical MIX and Design a New One.
Proceedings of the Advances in Cryptology, 2000

Key Agreement Protocol Securer than DLOG.
Proceedings of the International Colloquium on Words, 2000

Provably Secure Metering Scheme.
Proceedings of the Advances in Cryptology, 2000

Attack for Flash MIX.
Proceedings of the Advances in Cryptology, 2000

1999
Strongly universal hashing and identification codes via channels.
IEEE Trans. Information Theory, 1999

On a Fallacious Bound for Authentication Codes.
J. Cryptology, 1999

Efficient Rabin-type Digital Signature Scheme.
Des. Codes Cryptogr., 1999

On Cryptographically Secure Vectorial Boolean Functions.
Proceedings of the Advances in Cryptology, 1999

Probabilistic Higher Order Differential Attack and Higher Order Bent Functions.
Proceedings of the Advances in Cryptology, 1999

1998
Algebraic multidimensional phase unwrapping and zero distribution of complex polynomials-characterization of multivariate stable polynomials.
IEEE Trans. Signal Processing, 1998

Some Basic Properties of General Nonperfect Secret Sharing Schemes.
J. UCS, 1998

New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes.
Des. Codes Cryptogr., 1998

On the Randomness of a [d, k] Self-Decimation Stream Key Generator.
Proceedings of the Sequences and their Applications, 1998

Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k.
Proceedings of the Sequences and their Applications, 1998

Optimum Traitor Tracing and Asymmetric Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

Some Bounds and a Construction for Secure Broadcast Encryption.
Proceedings of the Advances in Cryptology, 1998

A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group.
Proceedings of the Information Security and Privacy, Third Australasian Conference, 1998

1997
Highly Nonlinear t-resilient Functions.
J. UCS, 1997

Fault tolerant anonymous channel.
Proceedings of the Information and Communication Security, First International Conference, 1997

A2-code = Affine resolvable = BIBD.
Proceedings of the Information and Communication Security, First International Conference, 1997

Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria.
Proceedings of the Advances in Cryptology, 1997

Almost k-wise Independent Sample Spaces and Their Cryptologic Applications.
Proceedings of the Advances in Cryptology, 1997

Characterisation of (k, n) Multi-receiver Authentication.
Proceedings of the Information Security and Privacy, Second Australasian Conference, 1997

1996
Fast stability test algorithm for discrete time systems.
Signal Processing, 1996

Multisymbol Majority Vote and Hard Core.
Inf. Process. Lett., 1996

Veto is Impossible in Secret Sharing Schemes.
Inf. Process. Lett., 1996

Combinatorial Lower Bounds for Secret Sharing Schemes.
Inf. Process. Lett., 1996

Optimum Secret Sharing Scheme Secure against Cheating.
Proceedings of the Advances in Cryptology, 1996

Generalization of Higher Order SAC to Vector Output Boolean Functions.
Proceedings of the Advances in Cryptology, 1996

1995
Low Exponent Attack Against Elliptic Curve RSA.
Inf. Process. Lett., 1995

Power Complementary and Linear Phase Filter Banks.
Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

Combinatorial Bounds for Authentication Codes with Arbitration.
Proceedings of the Advances in Cryptology, 1995

t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1995

New Bound for Afine Resolvable Designs and Its Application to Authentication Codes.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Optimum Highpass Filter in Linear Phase Perfect Reconstruction QMF Bank.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

A Necessary Condition for Linear Phase in Two Dimensional Perfect Reconstruction QMF Banks.
Proceedings of the 1994 IEEE International Symposium on Circuits and Systems, ISCAS 1994, London, England, UK, May 30, 1994

New Bound on Authentication Code with Arbitration.
Proceedings of the Advances in Cryptology, 1994

Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

Low Exponent Attack against Elliptic Curve RSA.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

Security of the Center in Key Distribution Schemes.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

Combinatorial Interpretation of Secret Sharing Schemes.
Proceedings of the Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28, 1994

1993
A fast stability test for multidimensional systems.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

Stability and zeros of a complex polynomial.
Proceedings of the 1993 IEEE International Symposium on Circuits and Systems, 1993

On Key Distribution and Authentication in Mobile Radio Networks.
Proceedings of the Advances in Cryptology, 1993

Efficient Anonymous Channel and All/Nothing Election Scheme.
Proceedings of the Advances in Cryptology, 1993

Nonperfect Secret Sharing Schemes and Matroids.
Proceedings of the Advances in Cryptology, 1993

1992
Computational and Statistical Indistinguishabilities.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Privacy for Multi-Party Protocols.
Proceedings of the Advances in Cryptology, 1992

Nonperfect Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 1992

1991
4 Move Perfect ZKIP of Knowledge with No Assumption.
Proceedings of the Advances in Cryptology, 1991

On Claw Free Families.
Proceedings of the Advances in Cryptology, 1991

1990
General Public Key Residue Cryptosystems and Mental Poker Protocols.
Proceedings of the Advances in Cryptology, 1990

Multi-Language Zero Knowledge Interactive Proof Systems.
Proceedings of the Advances in Cryptology, 1990

1989
An IIR parallel-type adaptive algorithm using the fast least squares method.
IEEE Trans. Acoustics, Speech, and Signal Processing, 1989

A polynomial time validation method for channel boundedness of communication protocols (2 processes).
Systems and Computers in Japan, 1989

1988
A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations.
Systems and Computers in Japan, 1988

A Validation Method for Communication Protocols Using Context-Free Language Theory.
Systems and Computers in Japan, 1988

Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number.
Cryptologia, 1988

1986
An Efficient Method to Find Invalid Loops in a Communication Protocol and Its Application to HDLC.
Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986


  Loading...