Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleAugust 2018
Commitment and Oblivious Transfer in the Bounded Storage Model With Errors
IEEE Transactions on Information Theory (ITHR), Volume 64, Issue 8Aug. 2018, Pages 5970–5984https://doi.org/10.1109/TIT.2018.2796128The bounded storage model restricts the memory of an adversary in a cryptographic protocol, rather than restricting its computational power, making information theoretically secure protocols feasible. We present the first protocols for commitment and ...
- research-articleOctober 2017
On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability
IEEE Transactions on Information Theory (ITHR), Volume 63, Issue 10Oct. 2017, Pages 6819–6826https://doi.org/10.1109/TIT.2017.2735423Noisy channels are a powerful resource for cryptography as they can be used to obtain information-theoretic secure key agreement, commitment, and oblivious transfer protocols, among others. Oblivious transfer (OT) is a fundamental primitive, since it is ...
- research-articleJanuary 2016
Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra
- Bernardo David,
- Rafael Dowsley,
- Jeroen van de Graaf,
- Davidson Marques,
- Anderson C. A. Nascimento,
- Adriana C. B. Pinto
IEEE Transactions on Information Forensics and Security (TIFS), Volume 11, Issue 1Jan. 2016, Pages 59–73https://doi.org/10.1109/TIFS.2015.2476783Linear algebra operations on private distributed data are frequently required in several practical scenarios (e.g., statistical analysis and privacy preserving databases). We present universally composable two-party protocols to compute inner products, ...
- ArticleNovember 2015
Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols
ProvSec 2015: Proceedings of the 9th International Conference on Provable Security - Volume 9451November 2015, Pages 354–367https://doi.org/10.1007/978-3-319-26059-4_20We propose an efficient unconditionally secure protocol for privacy preserving comparison of $$\ell $$ℓ-bit integers when both integers are shared between two semi-honest parties. Using our comparison protocol as a building block, we construct two-party ...
- research-articleOctober 2015
Fast, Privacy Preserving Linear Regression over Distributed Datasets based on Pre-Distributed Data
AISec '15: Proceedings of the 8th ACM Workshop on Artificial Intelligence and SecurityOctober 2015, Pages 3–14https://doi.org/10.1145/2808769.2808774This work proposes a protocol for performing linear regression over a dataset that is distributed over multiple parties. The parties will jointly compute a linear regression model without actually sharing their own private datasets. We provide security ...
- articleFebruary 2015
Information-theoretically secure oblivious polynomial evaluation in the commodity-based model
- Rafael Tonicelli,
- Anderson C. Nascimento,
- Rafael Dowsley,
- Jörn Müller-Quade,
- Hideki Imai,
- Goichiro Hanaoka,
- Akira Otsuka
International Journal of Information Security (IJOIS), Volume 14, Issue 1February 2015, Pages 73–84https://doi.org/10.1007/s10207-014-0247-8Oblivious polynomial evaluation (OPE) consists of a two-party protocol where a sender inputs a polynomial $$p(x)$$ p ( x ) and a receiver inputs a single value $$x_{0}$$ x 0 . At the end of the protocol, the sender learns nothing and the receiver learns $$p(x_{0})$$ p ( x 0 ) . This paper deals with the ...
- ArticleDecember 2012
IND-CCA secure cryptography based on a variant of the LPN problem
ASIACRYPT'12: Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information SecurityDecember 2012, Pages 485–503https://doi.org/10.1007/978-3-642-34961-4_30In 2003 Michael Alekhnovich (FOCS 2003) introduced a novel variant of the learning parity with noise problem and showed that it implies IND-CPA secure public-key cryptography. In this paper we introduce the first public-key encryption-scheme based on ...
- research-articleOctober 2012
A CCA2 Secure Variant of the McEliece Cryptosystem
IEEE Transactions on Information Theory (ITHR), Volume 58, Issue 10October 2012, Pages 6672–6680https://doi.org/10.1109/TIT.2012.2203582The McEliece public-key encryption scheme has become an interesting alternative to cryptosystems based on number-theoretical problems. Different from RSA and ElGamal, McEliece PKC is not known to be broken by a quantum computer. Moreover, even though ...
- ArticleAugust 2012
Universally composable oblivious transfer from lossy encryption and the mceliece assumptions
ICITS'12: Proceedings of the 6th international conference on Information Theoretic SecurityAugust 2012, Pages 80–99https://doi.org/10.1007/978-3-642-32284-6_5Oblivious transfer (OT) is a primitive of great importance in two-party and multi-party computation. We introduce a general construction of universally composable (UC) oblivious transfer protocols based on lossy cryptosystems in the common reference ...
- ArticleAugust 2010
A two-party protocol with trusted initializer for computing the inner product
WISA'10: Proceedings of the 11th international conference on Information security applicationsAugust 2010, Pages 337–350We propose the first protocol for securely computing the inner product modulo an integer m between two distrustful parties based on a trusted initializer, i.e. a trusted party that interacts with the players solely during a setup phase. We obtain a very ...
- ArticleAugust 2010
Round-optimal deniable ring authentication in the presence of big brother
WISA'10: Proceedings of the 11th international conference on Information security applicationsAugust 2010, Pages 307–321In this work we propose a Deniable Ring Authentication scheme secure against a powerful Big Brother type of adversary and yielding an optimal number of communication rounds. Our scheme is based on an infra-structure assumption: the existence of ...
- ArticleApril 2009
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
CT-RSA '09: Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in CryptologyApril 2009, Pages 240–251https://doi.org/10.1007/978-3-642-00862-7_16We show that a recently proposed construction by Rosen and Segev can be used for obtaining the first public key encryption scheme based on the McEliece assumptions which is secure against adaptive chosen ciphertext attacks in the standard model.
- ArticleAugust 2005
Efficient, non-optimistic secure circuit evaluation based on the elgamal encryption
WISA'05: Proceedings of the 6th international conference on Information Security ApplicationsAugust 2005, Pages 328–342https://doi.org/10.1007/11604938_26We propose a protocol for implementing secure function evaluation based on the homomorphic threshold ElGamal encryption scheme. To the best of our knowledge, our solution is more efficient in terms of computational complexity than previous solutions ...