scispace - formally typeset

Theory and Application of Cryptographic Techniques

About: Theory and Application of Cryptographic Techniques is an academic conference. The conference publishes majorly in the area(s): Encryption & Cryptography. Over the lifetime, 1590 publication(s) have been published by the conference receiving 170972 citation(s). more


Open accessBook ChapterDOI: 10.1007/3-540-48910-X_16
02 May 1999-
Abstract: This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes : a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular arithmetics, are provably secure under appropriate assumptions in the standard model. more

Topics: Probabilistic encryption (66%), Trapdoor function (65%), Paillier cryptosystem (58%) more

6,049 Citations

Open accessBook ChapterDOI: 10.1007/11426639_27
Amit Sahai1, Brent Waters2Institutions (2)
22 May 2005-
Abstract: We introduce a new type of Identity-Based Encryption (IBE) scheme that we call Fuzzy Identity-Based Encryption. In Fuzzy IBE we view an identity as set of descriptive attributes. A Fuzzy IBE scheme allows for a private key for an identity, ω, to decrypt a ciphertext encrypted with an identity, ω ′, if and only if the identities ω and ω ′ are close to each other as measured by the “set overlap” distance metric. A Fuzzy IBE scheme can be applied to enable encryption using biometric inputs as identities; the error-tolerance property of a Fuzzy IBE scheme is precisely what allows for the use of biometric identities, which inherently will have some noise each time they are sampled. Additionally, we show that Fuzzy-IBE can be used for a type of application that we term “attribute-based encryption”. In this paper we present two constructions of Fuzzy IBE schemes. Our constructions can be viewed as an Identity-Based Encryption of a message under several attributes that compose a (fuzzy) identity. Our IBE schemes are both error-tolerant and secure against collusion attacks. Additionally, our basic construction does not use random oracles. We prove the security of our schemes under the Selective-ID security model. more

Topics: Functional encryption (63%), Encryption (63%), Attribute-based encryption (62%) more

3,147 Citations

Open accessBook ChapterDOI: 10.1007/978-3-540-24676-3_30
02 May 2004-
Abstract: We study the problem of searching on data that is encrypted using a public key system. Consider user Bob who sends email to user Alice encrypted under Alice’s public key. An email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions. more

Topics: Email encryption (68%), Electronic mail (61%), Alice and Bob (60%) more

2,716 Citations

Open accessBook ChapterDOI: 10.1007/3-540-48285-7_33
Mitsuru Matsui1Institutions (1)
02 Jan 1994-
Abstract: We introduce a new method for cryptanalysis of DES cipher, which is essentially a known-plaintext attack. As a result, it is possible to break 8-round DES cipher with 221 known-plaintexts and 16-round DES cipher with 247 known-plaintexts, respectively. Moreover, this method is applicable to an only-ciphertext attack in certain situations. For example, if plaintexts consist of natural English sentences represented by ASCII codes, 8-round DES cipher is breakable with 229 ciphertexts only. more

Topics: Polyalphabetic cipher (74%), Two-square cipher (73%), Transposition cipher (72%) more

2,526 Citations

Open accessBook ChapterDOI: 10.1007/3-540-39568-7_2
Taher Elgamal1Institutions (1)
19 Aug 1984-
Abstract: A new signature scheme is proposed together with an implementation of the Diffie - Hellman key distribution scheme that achieves a public key cryptosystem. The security of both systems relies on the difficulty of computing discrete logarithms over finite fields. more

Topics: Cryptosystem (74%), Threshold cryptosystem (73%), Benaloh cryptosystem (73%) more

2,298 Citations

No. of papers from the Conference in previous years

Top Attributes

Show by:

Conference's top 5 most impactful authors

Rafail Ostrovsky

21 papers, 4.7K citations

Amit Sahai

19 papers, 4.8K citations

Mihir Bellare

17 papers, 4.9K citations

Ueli Maurer

15 papers, 2.1K citations

Yvo Desmedt

15 papers, 369 citations

Network Information
Related Conferences (5)
International Cryptology Conference

2.7K papers, 291.1K citations

98% related
Fast Software Encryption

597 papers, 35.7K citations

95% related
Public Key Cryptography

871 papers, 41.7K citations

95% related
The Cryptographers’ Track at the RSA Conference

559 papers, 26.3K citations

94% related