16 results on '"Le, Trieu"'
Search Results
2. Input and Output Privacy-Preserving Linear Regression
- Author
-
Takuya Hayashi, Yoshinori Aono, Lihua Wang, and Le Trieu Phong
- Subjects
Discrete mathematics ,LWE assumption ,Theoretical computer science ,Computer science ,homomorphic encryption ,Homomorphic encryption ,020206 networking & telecommunications ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Privacy preserving ,010201 computation theory & mathematics ,Artificial Intelligence ,Hardware and Architecture ,differential privacy ,Linear regression ,0202 electrical engineering, electronic engineering, information engineering ,linear regression ,Differential privacy ,Computer Vision and Pattern Recognition ,Electrical and Electronic Engineering ,Software ,Computer Science::Cryptography and Security - Abstract
We build a privacy-preserving system of linear regression protecting both input data secrecy and output privacy. Our system achieves those goals simultaneously via a novel combination of homomorphic encryption and differential privacy dedicated to linear regression and its variants (ridge, LASSO). Our system is proved scalable over cloud servers, and its efficiency is extensively checked by careful experiments.
- Published
- 2017
3. Anonymous and leakage resilient IBE and IPE
- Author
-
Kaoru Kurosawa and Le Trieu Phong
- Subjects
Theoretical computer science ,business.industry ,Applied Mathematics ,Decision Linear assumption ,Cryptography ,0102 computer and information sciences ,02 engineering and technology ,Construct (python library) ,Encryption ,01 natural sciences ,Computer Science Applications ,Identity (mathematics) ,010201 computation theory & mathematics ,Product (mathematics) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Leakage (economics) ,business ,Mathematics ,Anonymity - Abstract
We construct identity-based encryption and inner product encryption schemes under the decision linear assumption. Their private user keys are leakage-resilient in several scenarios. In particular, In addition, we prove that our IBE schemes are anonymous under the DLIN assumption, so that ciphertexts leaks no information on the corresponding identities. Similarly, attributes in IPE are proved computationally hidden in the corresponding ciphertexts.
- Published
- 2016
4. On the Convergence Proof of AMSGrad and a New Version
- Author
-
Phuong Thi Tran and Le Trieu Phong
- Subjects
FOS: Computer and information sciences ,0209 industrial biotechnology ,Computer Science - Machine Learning ,Theoretical computer science ,General Computer Science ,Computer science ,Machine Learning (stat.ML) ,adaptive moment estimation ,Adam ,02 engineering and technology ,Machine Learning (cs.LG) ,020901 industrial engineering & automation ,Simple (abstract algebra) ,Statistics - Machine Learning ,Convergence (routing) ,FOS: Mathematics ,0202 electrical engineering, electronic engineering, information engineering ,General Materials Science ,Mathematics - Optimization and Control ,General Engineering ,020206 networking & telecommunications ,Optimizer ,Moment (mathematics) ,AMSGrad ,deep neural networks ,Optimization and Control (math.OC) ,Convex optimization ,Benchmark (computing) ,lcsh:Electrical engineering. Electronics. Nuclear engineering ,lcsh:TK1-9971 - Abstract
The adaptive moment estimation algorithm Adam (Kingma and Ba) is a popular optimizer in the training of deep neural networks. However, Reddi et al. have recently shown that the convergence proof of Adam is problematic and proposed a variant of Adam called AMSGrad as a fix. In this paper, we show that the convergence proof of AMSGrad is also problematic. Concretely, the problem in the convergence proof of AMSGrad is in handling the hyper-parameters, treating them as equal while they are not. This is also the neglected issue in the convergence proof of Adam. We provide an explicit counter-example of a simple convex optimization setting to show this neglected issue. Depending on manipulating the hyper-parameters, we present various fixes for this issue. We provide a new convergence proof for AMSGrad as the first fix. We also propose a new version of AMSGrad called AdamX as another fix. Our experiments on the benchmark dataset also support our theoretical results., Update publication information
- Published
- 2019
5. Privacy-Preserving Logistic Regression with Distributed Data Sources via Homomorphic Encryption
- Author
-
Lihua Wang, Takuya Hayashi, Le Trieu Phong, and Yoshinori Aono
- Subjects
Theoretical computer science ,Computer science ,Homomorphic encryption ,020206 networking & telecommunications ,02 engineering and technology ,computer.software_genre ,Logistic regression ,Privacy preserving ,Artificial Intelligence ,Hardware and Architecture ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Computer Vision and Pattern Recognition ,Data mining ,Electrical and Electronic Engineering ,F1 score ,computer ,Software - Published
- 2016
6. Generic Fully Simulatable Adaptive Oblivious Transfer
- Author
-
Ryo Nojima, Kaoru Kurosawa, and Le Trieu Phong
- Subjects
Permutation ,Theoretical computer science ,Oblivious transfer ,Applied Mathematics ,Signal Processing ,Verifiable secret sharing ,Key encapsulation ,Electrical and Electronic Engineering ,Computer Graphics and Computer-Aided Design ,Mathematics ,Standard model (cryptography) - Abstract
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, and DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. The constructions follow a novel designing approach called “blind permutation”, which completely differs from existing ones. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic methods can be extended to build universally composable (UC) secure, and leakage-resilient OT protocols.
- Published
- 2015
7. A Generic yet Efficient Method for Secure Inner Product
- Author
-
Lihua Wang, Takuya Hayashi, Le Trieu Phong, and Yoshinori Aono
- Subjects
Theoretical computer science ,Computer science ,business.industry ,Computation ,Homomorphic encryption ,0102 computer and information sciences ,02 engineering and technology ,Encryption ,01 natural sciences ,010201 computation theory & mathematics ,Product (mathematics) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,business ,Computer Science::Cryptography and Security - Abstract
Secure inner product, namely the computation of inner product whose terms are all in encrypted form, is the central technique for various privacy-preserving applications. In this paper, we propose a generic yet efficient method to compute secure inner products of vectors (or matrices) using matrix trace properties. Indeed, our method not only applies to both LWE-based and ring-LWE-based homomorphic encryption schemes, but also is more efficient compared to previously known methods.
- Published
- 2017
8. Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions
- Author
-
Kaoru Kurosawa, Ryo Nojima, and Le Trieu Phong
- Subjects
Scheme (programming language) ,Theoretical computer science ,Relation (database) ,Computer science ,Convertible ,Applied Mathematics ,Probabilistic logic ,Computer Graphics and Computer-Aided Design ,Undeniable signature ,Signal Processing ,Verifiable secret sharing ,Electrical and Electronic Engineering ,computer ,Standard model (cryptography) ,computer.programming_language - Abstract
Verifiable random functions (VRF) and selectively convertible undeniable signature (SCUS) schemes were proposed independently in the literature. In this paper, we observe that they are tightly related. This directly yields several deterministic SCUS schemes based on existing VRF constructions. In addition, we create a new probabilistic SCUS scheme, which is very compact. The confirmation and disavowal protocols of these SCUS are efficient, and can be run either sequentially, concurrently, or arbitrarily. These protocols are based on what we call zero-knowledge protocols for generalized DDH and non-DDH, which are of independent interest.
- Published
- 2014
9. New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- Author
-
Kaoru Kurosawa, Wakaha Ogata, and Le Trieu Phong
- Subjects
Theoretical computer science ,Convertible ,Applied Mathematics ,Signal Processing ,Path (graph theory) ,Hardware_ARITHMETICANDLOGICSTRUCTURES ,Electrical and Electronic Engineering ,Computer Graphics and Computer-Aided Design ,Algorithm ,Undeniable signature ,Standard model (cryptography) ,Random oracle ,Mathematics - Abstract
In this paper, we design and analyze some new and practical (selectively) convertible undeniable signature (SCUS) schemes in both random oracle and standard model, which enjoy several merits over existing schemes in the literature. In particular, we design the first practical RSA-based SCUS schemes secure in the standard model. On the path, we also introduce two moduli RSA assumptions, including the strong twin RSA assumption, which is the RSA symmetry of the strong twin Diffie-Hellman assumption (Eurocrypt '08).
- Published
- 2010
10. Stateful Identity-Based Encryption Scheme: FasterEncryption and Decryption
- Author
-
Hiroto Matsuoka, Le Trieu Phong, and Wakaha Ogata
- Subjects
Provable security ,Theoretical computer science ,Plaintext-aware encryption ,business.industry ,Computer science ,Client-side encryption ,Cryptography ,computer.software_genre ,Encryption ,Disk encryption hardware ,Random oracle ,Deterministic encryption ,Multiple encryption ,Filesystem-level encryption ,Disk encryption ,Probabilistic encryption ,Pairing ,56-bit encryption ,40-bit encryption ,Attribute-based encryption ,Link encryption ,On-the-fly encryption ,business ,computer - Abstract
In this paper, we first present the notion of stateful identity-based encryption (IBE) and then extend standard security definitions for IBE to the stateful setting. After that, we demonstrate a concrete stateful IBE scheme, whose security meets the strongest definition in the setting in random oracle model, and whose encryption and decryption are very efficient, compared to existing IBEs: one pairing each for encryption and decryption.
- Published
- 2008
11. On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme
- Author
-
Le Trieu Phong and Wakaha Ogata
- Subjects
Theoretical computer science ,Plaintext-aware encryption ,business.industry ,Applied Mathematics ,Encryption ,Computer Graphics and Computer-Aided Design ,Deterministic encryption ,Multiple encryption ,Probabilistic encryption ,Signal Processing ,56-bit encryption ,40-bit encryption ,Attribute-based encryption ,Electrical and Electronic Engineering ,business ,Mathematics - Abstract
Kurosawa-Desmedt public-key encryption scheme is a variation of Cramer-Shoup public-key encryption schemes, which are the first practical schemes secure against adaptive chosen ciphertext attack (IND-CCA) in standard model. We introduce some variants of Kurosawa-Desmedt public-key encryption scheme which are also IND-CCA secure. Furthermore, the variants are either more efficient or less cryptographic assumptions than the original version.
- Published
- 2007
12. IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions
- Author
-
Kaoru Kurosawa and Le Trieu Phong
- Subjects
Scheme (programming language) ,Theoretical computer science ,Computer Networks and Communications ,business.industry ,Applied Mathematics ,Function (mathematics) ,Encryption ,Random oracle ,Computational Mathematics ,Computational Theory and Mathematics ,Ciphertext ,Overhead (computing) ,Limit (mathematics) ,business ,Algorithm ,computer ,Standard model (cryptography) ,computer.programming_language ,Mathematics - Abstract
Many identity-based encryption schemes under the k-LIN assumption contain 2k + 1 group elements in the ciphertext overhead and private keys. In this paper, we push the limit further by constructing an IBE scheme under the k-LIN assumption with 2k group elements in the ciphertext overhead and private keys. The schemes have variants with shorter public parameters under the k-SCasc assumption, which is a close assumption to k-LIN. Furthermore, via additional refinements, we also put efforts in reducing the public parameter size of our schemes, under either k-LIN or k-SCasc. While we mainly consider securities in the standard model for our schemes, we also show how to make relatively more efficient schemes secure in the random oracle model. Our technique additionally expands to the scheme of Boneh et al. (CRYPTO 2013) to yield more efficient function-private IBE under the 2-LIN (aka, DLIN) assumption. Overall, the shortened size in ciphertexts and private keys inherently leads to fewer exponentiations and pairings in encryption and decryption, and hence yields schemes with better computational efficiency.
- Published
- 2017
13. Kurosawa-Desmedt Key Encapsulation Mechanism, Revisited
- Author
-
Le Trieu Phong and Kaoru Kurosawa
- Subjects
Public-key cryptography ,Theoretical computer science ,Computer science ,business.industry ,Hash function ,Ciphertext ,Key encapsulation ,business ,Encapsulation (networking) - Abstract
While the hybrid public key encryption scheme of Kurosawa and Desmedt (CRYPTO 2004) is provably secure against chosen ciphertext attacks (namely, IND-CCA-secure), its associated key encapsulation mechanism (KEM) is not IND-CCA-secure (Herranz et al. 2006, Choi et al. 2009). In this paper, we show a simple twist on the Kurosawa-Desmedt KEM turning it into a scheme with IND-CCA security under the decisional Diffie-Hellman assumption. Our KEM beats the standardized version of Cramer-Shoup KEM in ISO/IEC 18033-2 by margins of at least 20% in encapsulation speed, and 20% ~ 60% in decapsulation speed. Moreover, the public and secret key sizes in our schemes are at least 160-bit smaller than those of the Cramer-Shoup KEM. We then generalize the technique into hash proof systems, proposing several KEM schemes with IND-CCA security under decision linear and decisional composite residuosity assumptions respectively. All the KEMs are in the standard model, and use standard, computationally secure symmetric building blocks.
- Published
- 2014
14. Key-Private Proxy Re-encryption under LWE
- Author
-
Le Trieu Phong, Yoshinori Aono, Lihua Wang, and Xavier Boyen
- Subjects
Cryptographic primitive ,Theoretical computer science ,Alice and Bob ,business.industry ,Ciphertext ,Encryption ,business ,Proxy (statistics) ,Learning with errors ,Proxy re-encryption ,Random oracle ,Mathematics - Abstract
Proxy re-encryption (PRE) is a highly useful cryptographic primitive whereby Alice and Bob can endow a proxy with the capacity to change ciphertext recipients from Alice to Bob, without the proxy itself being able to decrypt, thereby providing delegation of decryption authority. Key-private PRE (KP-PRE) specifies an additional level of confidentiality, requiring pseudo-random proxy keys that leak no information on the identity of the delegators and delegatees. In this paper, we propose a CPA-secure PK-PRE scheme in the standard model (which we then transform into a CCA-secure scheme in the random oracle model). Both schemes enjoy highly desirable properties such as uni-directionality and multi-hop delegation. Unlike (the few) prior constructions of PRE and KP-PRE that typically rely on bilinear maps under ad hoc assumptions, security of our construction is based on the hardness of the standard Learning-With-Errors (LWE) problem, itself reducible from worst-case lattice hard problems that are conjectured immune to quantum cryptanalysis, or "post-quantum". Of independent interest, we further examine the practical hardness of the LWE assumption, using Kannan's exhaustive search algorithm coupling with pruning techniques. This leads to state-of-the-art parameters not only for our scheme, but also for a number of other primitives based on LWE published the literature.
- Published
- 2013
15. Generic Fully Simulatable Adaptive Oblivious Transfer
- Author
-
Kaoru Kurosawa, Ryo Nojima, and Le Trieu Phong
- Subjects
Permutation ,Theoretical computer science ,Oblivious transfer ,Verifiable secret sharing ,Construct (python library) ,Key encapsulation ,Mathematics ,Standard model (cryptography) - Abstract
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, DLIN (and more generally, d-linear), QR, DCR. To this end, we present two generic constructions of adaptive OT, one of which utilizes verifiable shuffles together with threshold decryption schemes, while the other uses permutation networks together with what we call loosely-homomorphic key encapsulation schemes. We then show that specific choices of the building blocks lead to concrete adaptive OT protocols with fully simulatable security in the standard model under the targeted assumptions. Our generic method can be further used to construct the first (memory) leakage-resilient adaptive OT.
- Published
- 2011
16. Provably Secure Convertible Undeniable Signatures with Unambiguity
- Author
-
Wakaha Ogata, Kaoru Kurosawa, and Le Trieu Phong
- Subjects
Theoretical computer science ,Ring signature ,Discrete logarithm ,Convertible ,Computer security ,computer.software_genre ,computer ,Computer Science::Databases ,Signature (logic) ,Undeniable signature ,Computer Science::Cryptography and Security ,Standard model (cryptography) ,Mathematics - Abstract
This paper shows some efficient and provably-secure convertible undeniable signature schemes (with both selective conversion and all conversion), in the standard model and discrete logarithm setting. They further satisfy unambiguity, which is traditionally required for anonymous signatures. Briefly, unambiguity means that it is hard to generate a (message, signature) pair which is valid for two different public-keys. In other words, our schemes can be viewed as anonymous signature schemes as well as convertible undeniable signature schemes. Besides other applications, we show that such schemes are very suitable for anonymous auction.
- Published
- 2010
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.