scispace - formally typeset
Search or ask a question
Topic

Cipher

About: Cipher is a research topic. Over the lifetime, 9409 publications have been published within this topic receiving 110309 citations. The topic is also known as: cypher & cryptographic algorithm.


Papers
More filters
Journal ArticleDOI
TL;DR: Two new reversible data hiding algorithms are proposed for the encrypted images that are more applicable in cloud computing without degrading the security level and can be losslessly transmitted in the different applications of Paillier cryptosystem.

60 citations

Book ChapterDOI
19 Aug 2012
TL;DR: It is proved that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security assuming an ideal round function to a number of adversarial queries that is nearly the size of the construction's domain.
Abstract: We introduce the swap-or-not shuffle and show that the technique gives rise to a new method to convert a pseudorandom function PRF into a pseudorandom permutation PRP or, alternatively, to directly build a confusion/diffusion blockcipher. We then prove that swap-or-not has excellent quantitative security bounds, giving a Luby-Rackoff type result that ensures security assuming an ideal round function to a number of adversarial queries that is nearly the size of the construction's domain. Swap-or-not provides a direct solution for building a small-domain cipher and achieving format-preserving encryption, yielding the best bounds known for a practical scheme for enciphering credit-card numbers. The analysis of swap-or-not is based on the theory of mixing times of Markov chains.

60 citations

Patent
07 May 1990
TL;DR: In this article, a shared cryptokey (k) was proposed to be shared among entities (A, B) engaged in communications, in particular one known as the key predistribution system.
Abstract: A system for generating a cryptokey (k) to be shared among entities (A, B) engaged in communications, in particular one known as the key predistribution system. Indentifiers (yA, yS) for the entities engaging in communications under a center and a center algorithm (G) which only the center knows are generated, then secret algorithms (xA, XB) distinct to each entity are generated on added to IC cards or other cipher generation means (2, 3). A cipher generation means (2, 3) is provided for each entity. The identifiers (yB, yA) of the other entity are applied to compute a cryptokey, whereby a common cryptokey is generated. Also disclosed is a system for communications using the above shared cryptokey.

60 citations

Proceedings ArticleDOI
13 Dec 2008
TL;DR: Compared differences in the use of symmetric and asymmetric cryptography for SMS transfer securing are compared and design and implementation of the application for mobile phones, which encrypts and signs SMS using an asymmetric RSA cipher are described.
Abstract: This paper deals with an SMS encryption for mobile communication. The transmission of an SMS in GSM network is not secure, therefore it is desirable to secure SMS by additional encryption. In the following text, there are compared differences in the use of symmetric and asymmetric cryptography for SMS transfer securing. In the next part, there is the description of design and implementation of the application for mobile phones, which encrypts and signs SMS using an asymmetric RSA cipher. At the end, there are described attacks on secured SMS and future extension of the application.

60 citations

Posted Content
TL;DR: In this article, the authors present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic.
Abstract: We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We obtain as a consequence database encryption methods that permit fast (i.e. sub-linear, and in fact logarithmic, time) search while provably providing privacy that is as strong as possible subject to this fast search constraint. One of our constructs, called RSA-DOAEP, has the added feature of being length preserving, so that it is the first example of a public-key cipher. We generalize this to obtain a notion of efficiently-searchable encryption schemes which permit more flexible privacy to search-time trade-offs via a technique called bucketization. Our results answer muchasked questions in the database community and provide foundations for work done there.

60 citations


Network Information
Related Topics (5)
Cryptography
37.3K papers, 854.5K citations
90% related
Encryption
98.3K papers, 1.4M citations
89% related
Authentication
74.7K papers, 867.1K citations
85% related
Public-key cryptography
27.2K papers, 547.7K citations
85% related
Key (cryptography)
60.1K papers, 659.3K citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023155
2022309
2021343
2020415
2019509
2018487