Browsing by Keywords "Cryptography"
Now showing items 1-18 of 18
-
Cryptographic solutions for genomic privacy
(Springer, 2016-02)With the help of rapidly developing technology, DNA sequencing is becoming less expensive. As a consequence, the research in genomics has gained speed in paving the way to personalized (genomic) medicine, and geneticists ... -
Differential entropy analysis of the IDEA block cipher
(Elsevier, 2014)This paper describes a new cryptanalytic technique that combines differential cryptanalysis with Shannon entropy. We call it differential entropy (DE). The objective is to exploit the non-uniform distribution of output ... -
Generalizations of verheul's theorem to asymmetric pairings
(2013)For symmetric pairings e: G × G → GT, Verheul proved that the existence of an efficiently-computable isomorphism Φ: GT → G implies that the Diffie-Hellman problems in G and GT can be efficiently solved. In this paper, we ... -
Generalized ID-based ElGamal signatures
(IEEE, 2007-11)ID-based cryptography has been a very active area of research in cryptography since bilinear pairings were introduced as a cryptographic tool, and there have been many proposals for ID-based signatures recently. In this ... -
GenoGuard: protecting genomic data against brute-force attacks
(IEEE, 2015-05)Secure storage of genomic data is of great and increasing importance. The scientific community's improving ability to interpret individuals' genetic materials and the growing size of genetic database populations have been ... -
A meet-in-the-middle attack on 8-round AES
(Springer, 2008-02)We present a 5-round distinguisher for AES. We exploit this distinguisher to develop a meet-in-the-middle attack on 7 rounds of AES-192 and 8 rounds of AES-256. We also give a time-memory tradeoff generalization of the ... -
On non-cooperative genomic privacy
(Springer, Berlin, Heidelberg, 2015)Over the last few years, the vast progress in genome sequencing has highly increased the availability of genomic data. Today, individuals can obtain their digital genomic sequences at reasonable prices from many online ... -
On probability of success in linear and differential cryptanalysis
(Springer New York LLC, 2008-01)Despite their widespread usage in block cipher security, linear and differential cryptanalysis still lack a robust treatment of their success probability, and the success chances of these attacks have commonly been estimated ... -
Persistent perfect entanglement in atomic systems
(IOP, 2004)It is shown that the system of an even number of three-level atoms in the Λ configuration in a cavity can evolve into a persistent maximum entangled state. The time of formation of such an entangled state is estimated. -
Privacy threats and practical solutions for genetic risk tests
(IEEE, 2015)Recently, several solutions have been proposed to address the complex challenge of protecting individuals' genetic data during personalized medicine tests. In this short paper, we analyze different privacy threats and ... -
Privacy-preserving data sharing and utilization between entities
(Bilkent University, 2017-07)In this thesis, we aim to enable privacy-preserving data sharing between entities and propose two systems for this purpose: (i) a veri able computation scheme that enables privacy-preserving similarity computation in the ... -
A privacy-preserving solution for the bipartite ranking problem
(IEEE, 2016-12)In this paper, we propose an efficient solution for the privacy-preserving of a bipartite ranking algorithm. The bipartite ranking problem can be considered as finding a function that ranks positive instances (in a dataset) ... -
Robust threshold schemes based on the Chinese remainder theorem
(Springer, 2008-06)Recently, Chinese Remainder Theorem (CRT) based function sharing schemes are proposed in the literature. In this paper, we investigate how a CRT-based threshold scheme can be enhanced with the robustness property. To the ... -
The Shannon cipher system with a guessing wiretapper
(Institute of Electrical and Electronics Engineers, 1999-09)The Shannon theory of cipher systems is combined with recent work on guessing values of random variables. The security of encryption systems is measured in terms of moments of the number of guesses needed for the wiretapper ... -
Threshold broadcast encryption with reduced complexity
(IEEE, 2007-11)Threshold Broadcast Encryption (TBE) is a promising extension of threshold cryptography with its advantages over traditional threshold cryptosystems, such as eliminating the need of a trusted party, the ability of setting ... -
Threshold cryptography based on asmuth-bloom secret sharing
(Springer, 2006-11)In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present two novel function sharing schemes, one for the RSA signature and the other for the ElGamal ... -
A verifiable secret sharing scheme based on the chinese remainder theorem
(Springer, 2008-12)In this paper, we investigate how to achieve verifiable secret sharing (VSS) schemes by using the Chinese Remainder Theorem (CRT). We first show that two schemes proposed earlier are not secure by an attack where the dealer ... -
Watermarking based on discrete wavelet transform and q-deformed chaotic map
(Elsevier Ltd, 2017)Hierarchy of one-dimensional ergodic chaotic maps with Tsallis type of q-deformation are studied. We find that in the chaotic region, these maps with q-deformation are ergodic as the Birkhoff ergodic theorem predicts. ...
