| Publication | Date of Publication | Type |
|---|
Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
| 2024-11-13 | Paper |
Multi-server PIR with full error detection and limited error correction
| 2024-06-25 | Paper |
CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (Not $$\mathtt {q}$$ -type) Assumptions
| 2024-03-14 | Paper |
How to Solve Multiple Short-Exponent Discrete Logarithm Problem
| 2024-03-14 | Paper |
New bound for affine resolvable designs and its application to authentication codes
Lecture Notes in Computer Science | 2023-12-12 | Paper |
On the optimal communication complexity of error-correcting multi-server PIR
Theory of Cryptography | 2023-08-14 | Paper |
More efficient construction of bounded KDM secure encryption
| 2022-07-01 | Paper |
Optimum attack on 3-round Feistel-2 structure
| 2022-04-22 | Paper |
Bit-slice auction circuit
Computer Security — ESORICS 2002 | 2022-02-16 | Paper |
Efficient no-dictionary verifiable searchable symmetric encryption
Financial Cryptography and Data Security | 2021-03-17 | Paper |
How to correct errors in multi-server PIR
| 2020-05-05 | Paper |
IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions
International Journal of Applied Cryptography | 2018-11-26 | Paper |
How to solve DLOG problem with auxiliary input
| 2018-10-24 | Paper |
How to prove KDM security of BHHO
| 2018-10-24 | Paper |
UC-secure dynamic searchable symmetric encryption scheme
| 2018-10-24 | Paper |
Anonymous and leakage resilient IBE and IPE
Designs, Codes and Cryptography | 2017-10-06 | Paper |
One-Wayness Equivalent to General Factoring
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Power of a Public Random Permutation and Its Application to Authenticated Encryption
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
General Error Decodable Secret Sharing Scheme and Its Application
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
How to make a linear network code (strongly) secure
Designs, Codes and Cryptography | 2017-02-17 | Paper |
Combinatorial lower bounds for secret sharing schemes
Information Processing Letters | 2016-05-26 | Paper |
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
Lecture Notes in Computer Science | 2016-03-02 | Paper |
IBE Under $$k$$-LIN with Shorter Ciphertexts and Private Keys
Information Security and Privacy | 2015-10-20 | Paper |
How to construct strongly secure network coding scheme
Lecture Notes in Computer Science | 2015-09-30 | Paper |
(Batch) fully homomorphic encryption over integers for non-binary message spaces
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Improved reconstruction of RSA private-keys from their fraction
Information Processing Letters | 2015-05-21 | Paper |
How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$
Advances in Information and Computer Security | 2014-09-15 | Paper |
Optimum Secret Sharing Scheme Secure against Cheating
Advances in Cryptology — EUROCRYPT ’96 | 2014-08-20 | Paper |
Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
Progress in Cryptology – AFRICACRYPT 2014 | 2014-06-24 | Paper |
2-pass key exchange protocols from CPA-secure KEM
Topics in Cryptology – CT-RSA 2014 | 2014-03-28 | Paper |
Leakage resilient IBE and IPE under the DLIN assumption
Applied Cryptography and Network Security | 2014-01-24 | Paper |
New leakage-resilient CCA-secure public key encryption
Journal of Mathematical Cryptology | 2014-01-23 | Paper |
Relation between verifiable random functions and convertible undeniable signatures, and new constructions
Information Security and Privacy | 2012-09-07 | Paper |
Round-efficient perfectly secure message transmission scheme against general adversary
Designs, Codes and Cryptography | 2012-03-23 | Paper |
Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
Applied Cryptography and Network Security | 2011-06-28 | Paper |
Generic fully simulatable adaptive oblivious transfer
Applied Cryptography and Network Security | 2011-06-28 | Paper |
The round complexity of perfectly secure general VSS
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Cryptography for Unconditionally Secure Message Transmission in Networks (Invited Talk)
Cryptology and Network Security | 2010-12-07 | Paper |
Efficiency-improved fully simulatable adaptive OT under the DDH assumption
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Provably secure convertible undeniable signatures with unambiguity
Lecture Notes in Computer Science | 2010-09-10 | Paper |
A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack
Journal of Cryptology | 2010-03-01 | Paper |
Error correcting and complexity aspects of linear secret sharing schemes
Lecture Notes in Computer Science | 2010-02-09 | Paper |
Some RSA-based encryption schemes with tight security reduction
Lecture Notes in Computer Science | 2010-01-05 | Paper |
A complete and explicit security reduction algorithm for RSA-based cryptosystems
Lecture Notes in Computer Science | 2010-01-05 | Paper |
OMAC: one-key CBC MAC.
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Simple adaptive oblivious transfer without random oracle
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Almost Secure (1-Round, n-Channel) Message Transmission Scheme
Lecture Notes in Computer Science | 2009-12-03 | Paper |
New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
Progress in Cryptology – AFRICACRYPT 2009 | 2009-07-07 | Paper |
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Public Key Cryptography – PKC 2004
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Topics in Cryptology – CT-RSA 2004
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Topics in Cryptology – CT-RSA 2004
Lecture Notes in Computer Science | 2009-05-07 | Paper |
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
The power of identification schemes
International Journal of Applied Cryptography | 2009-01-15 | Paper |
Simple Direct Reduction of String (1,2)-OT to Rabin’s OT without Privacy Amplification
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Almost Security of Cryptographic Boolean Functions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The security of the FDH variant of Chaum's undeniable signature scheme
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Relations Among Security Notions for Undeniable Signature Schemes
Lecture Notes in Computer Science | 2008-11-27 | Paper |
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Universally Composable Undeniable Signature
Automata, Languages and Programming | 2008-08-19 | Paper |
A Generalization and a Variant of Two Threshold Cryptosystems Based on Factoring
Lecture Notes in Computer Science | 2008-06-24 | Paper |
Birthday Paradox for Multi-collisions
Information Security and Cryptology – ICISC 2006 | 2008-05-06 | Paper |
3-Move Undeniable Signature Scheme
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Small Secret Key Attack on a Variant of RSA (Due to Takagi)
Topics in Cryptology – CT-RSA 2008 | 2008-04-24 | Paper |
New Approach for Selectively Convertible Undeniable Signature Schemes
Advances in Cryptology – ASIACRYPT 2006 | 2008-04-24 | Paper |
Tag-KEM/DEM: A new framework for hybrid encryption
Journal of Cryptology | 2008-04-16 | Paper |
Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Progress in Cryptology - INDOCRYPT 2003
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Cryptography and Coding
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Immunity against correlation attack on quantum stream cipher by Yuen 2000 protocol
Quantum Information Processing | 2007-09-20 | Paper |
An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge
Automata, Languages and Programming | 2007-09-11 | Paper |
Tag-KEM from Set Partial Domain One-Way Permutations
Information Security and Privacy | 2007-09-07 | Paper |
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Public Key Cryptography - PKC 2006
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Public Key Cryptography - PKC 2006
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Information Security
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Fast Software Encryption
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Optimum Secret Sharing Scheme Secure against Cheating
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
How to break a practical MIX and design a new one
| 2006-03-01 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Public Key Cryptography - PKC 2005
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Information Security and Privacy
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Information Security and Privacy
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
scientific article; zbMATH DE number 2089134 (Why is no real title available?)
| 2004-08-12 | Paper |
Round Security and Super-Pseudorandomness of MISTY Type Structure
Fast Software Encryption | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2085429 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2085196 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2085421 (Why is no real title available?)
| 2004-08-09 | Paper |
Oblivious keyword search
Journal of Complexity | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080992 (Why is no real title available?)
| 2004-08-04 | Paper |
New combinatorial designs and their applications to authentication codes and secret sharing schemes.
Discrete Mathematics | 2004-03-29 | Paper |
Non-cryptographic primitive for pseudorandom permutation.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2043348 (Why is no real title available?)
| 2004-02-16 | Paper |
scientific article; zbMATH DE number 2043316 (Why is no real title available?)
| 2004-02-16 | Paper |
scientific article; zbMATH DE number 2043349 (Why is no real title available?)
| 2004-02-16 | Paper |
Algebraic multidimensional phase unwrapping and zero distribution of complex polynomials -- characterization of multivariate stable polynomials
IEEE Transactions on Signal Processing | 2003-12-02 | Paper |
scientific article; zbMATH DE number 1962141 (Why is no real title available?)
| 2003-08-10 | Paper |
scientific article; zbMATH DE number 1950615 (Why is no real title available?)
| 2003-07-17 | Paper |
Bounds for Robust Metering Schemes and Their Relationship with A2-code
Lecture Notes in Computer Science | 2003-07-16 | Paper |
scientific article; zbMATH DE number 1759328 (Why is no real title available?)
| 2003-01-25 | Paper |
scientific article; zbMATH DE number 1759273 (Why is no real title available?)
| 2002-10-13 | Paper |
scientific article; zbMATH DE number 1618038 (Why is no real title available?)
| 2002-09-01 | Paper |
On the bound for anonymous secret sharing schemes
Discrete Applied Mathematics | 2002-08-29 | Paper |
scientific article; zbMATH DE number 1740046 (Why is no real title available?)
| 2002-05-14 | Paper |
scientific article; zbMATH DE number 1740052 (Why is no real title available?)
| 2002-05-14 | Paper |
Combinatorial classification of optimal authentication codes with arbitration
Designs, Codes and Cryptography | 2002-01-31 | Paper |
scientific article; zbMATH DE number 1689014 (Why is no real title available?)
| 2002-01-09 | Paper |
Almost \(k\)-wise independent sample spaces and their cryptologic applications
Journal of Cryptology | 2002-01-02 | Paper |
scientific article; zbMATH DE number 1676650 (Why is no real title available?)
| 2001-11-25 | Paper |
Combinatorial bounds on authentication codes with arbitration.
Designs, Codes and Cryptography | 2001-07-03 | Paper |
scientific article; zbMATH DE number 1583793 (Why is no real title available?)
| 2001-07-03 | Paper |
scientific article; zbMATH DE number 1583779 (Why is no real title available?)
| 2001-04-03 | Paper |
scientific article; zbMATH DE number 1543298 (Why is no real title available?)
| 2001-02-27 | Paper |
scientific article; zbMATH DE number 1543052 (Why is no real title available?)
| 2001-02-26 | Paper |
Bounds and combinatorial structure of \((k,n)\) multi-receiver \(A\)-codes
Designs, Codes and Cryptography | 2001-02-18 | Paper |
scientific article; zbMATH DE number 1504540 (Why is no real title available?)
| 2000-09-12 | Paper |
scientific article; zbMATH DE number 1504536 (Why is no real title available?)
| 2000-09-12 | Paper |
MDS secret-sharing scheme secure against cheaters
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
A relationship between linear complexity and k-error linear complexity
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Strongly universal hashing and identification codes via channels
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
scientific article; zbMATH DE number 1500491 (Why is no real title available?)
| 2000-09-04 | Paper |
scientific article; zbMATH DE number 697822 (Why is no real title available?)
| 2000-06-21 | Paper |
On a fallacious bound for authentication codes
Journal of Cryptology | 2000-05-22 | Paper |
scientific article; zbMATH DE number 1406776 (Why is no real title available?)
| 2000-03-01 | Paper |
scientific article; zbMATH DE number 1394300 (Why is no real title available?)
| 2000-01-31 | Paper |
scientific article; zbMATH DE number 1394291 (Why is no real title available?)
| 2000-01-31 | Paper |
New combinatorial bounds for authentication codes and key predistribution schemes
Designs, Codes and Cryptography | 1999-11-14 | Paper |
Efficient Rabin-type digital signature scheme
Designs, Codes and Cryptography | 1999-10-10 | Paper |
scientific article; zbMATH DE number 1315617 (Why is no real title available?)
| 1999-09-13 | Paper |
scientific article; zbMATH DE number 1303119 (Why is no real title available?)
| 1999-09-09 | Paper |
scientific article; zbMATH DE number 1302811 (Why is no real title available?)
| 1999-06-17 | Paper |
scientific article; zbMATH DE number 1301087 (Why is no real title available?)
| 1999-06-15 | Paper |
A2-code = Affine resolvable + BIBD
Information and Communications Security | 1998-07-03 | Paper |
scientific article; zbMATH DE number 1107712 (Why is no real title available?)
| 1998-01-21 | Paper |
scientific article; zbMATH DE number 1030973 (Why is no real title available?)
| 1997-11-23 | Paper |
scientific article; zbMATH DE number 1024496 (Why is no real title available?)
| 1997-07-20 | Paper |
scientific article; zbMATH DE number 1024106 (Why is no real title available?)
| 1997-06-18 | Paper |
scientific article; zbMATH DE number 1024014 (Why is no real title available?)
| 1997-06-18 | Paper |
scientific article; zbMATH DE number 1024085 (Why is no real title available?)
| 1997-06-18 | Paper |
scientific article; zbMATH DE number 1024083 (Why is no real title available?)
| 1997-06-18 | Paper |
scientific article; zbMATH DE number 1023999 (Why is no real title available?)
| 1997-06-18 | Paper |
Veto is impossible in secret sharing schemes
Information Processing Letters | 1997-02-27 | Paper |
Fast stability test algorithm for discrete time systems
Signal Processing | 1997-02-27 | Paper |
scientific article; zbMATH DE number 503261 (Why is no real title available?)
| 1994-09-20 | Paper |
scientific article; zbMATH DE number 177049 (Why is no real title available?)
| 1993-05-18 | Paper |
New noninteractive identity-based key distribution system
Electronics Letters | 1992-06-25 | Paper |
M mod 3 security of RSA
Electronics Letters | 1989-01-01 | Paper |
Cryptographically secure pseudorandom sequence generator based on reciprocal number cryptosystem
Electronics Letters | 1988-01-01 | Paper |
PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
Cryptologia | 1988-01-01 | Paper |
