Efficient Identification and Signatures for Smart Cards

Schnorr, Claus-Peter

doi:10.1007/0-387-34805-0_22

Cited by 964 publications

(556 citation statements)

References 6 publications

Supporting

Mentioning

500

Contrasting

Unclassified

Order By: Relevance

“…Schnorr [17], Chaum and Van Antwerpen [6], and others, and we refer the reader to these works for how to choose such groups. In particular, with appropriate assumptions on the distribution of primes if necessary, it can be done so that Gp is a subgroup of 2; for some q of size O(h), so that we may assume efficient group operations.…”

Section: Prirnegen) Such Groups Have Been Used For Cryptography By Cmentioning

confidence: 99%

Incremental Cryptography: The Case of Hashing and Signing

Bellare¹,

Goldreich

Goldwasser

Lecture Notes in Computer Science

199

176

View full text Add to dashboard Cite

Abstract. We initiate the investigation of a new kind of efficiency for cryptographic transformations. The idea is that having once applied the transformation to some document M , the time to update the result upon modification of M should be "proportional" to the "amount of modification" done to M. Thereby one obtains much faster cryptographic primitives for environments where closely related documents are undergoing the same cryptographic transformations.We provide some basic definitions enabling treatment of the new notion. We then exemplify our approach by suggesting incremental schemes for hashing and signing which are efficient according to our new measure.

show abstract

Section: Prirnegen) Such Groups Have Been Used For Cryptography By Cmentioning

confidence: 99%

Incremental Cryptography: The Case of Hashing and Signing

Bellare¹,

Goldreich

Goldwasser

Lecture Notes in Computer Science

199

176

View full text Add to dashboard Cite

show abstract

“…It is easy to compute the needed ValidityProof (Non-Interactive Zero-Knowledge Proofs of Knowledge), by a Schnorr's like non-interactive version of the proof of knowledge [31] using the Fiat-Shamir paradigm [19], in the random oracle model [5], as follows. Recall player U i has received in the up-flow F i a vector (X 1 , .…”

Section: Algorithmmentioning

confidence: 99%

A security solution for IEEE 802.11's ad hoc mode: password-authentication and group Diffie Hellman key exchange

Bresson¹,

Chevassut²,

Pointcheval³

2007

IJWMC

View full text Add to dashboard Cite

The IEEE 802 standards ease the deployment of networking infrastructures and enable employers to access corporate networks while traveling. These standards provide two modes of communication called infrastructure and ad-hoc modes. A security solution for the IEEE 802.11's infrastructure mode took several years to reach maturity and firmware are still been upgraded, yet a solution for the ad-hoc mode needs to be specified. The present paper is a first attempt in this direction. It leverages the latest developments in the area of password-based authentication and (group) DiffieHellman key exchange to develop a provably-secure key-exchange protocol for IEEE 802.11's ad-hoc mode. The protocol allows users to securely join and leave the wireless group at time, accommodates either a single-shared password or pairwise-shared passwords among the group members, or at least with a central server; achieves security against dictionary attacks in the ideal-hash model (i.e. random-oracles). This is, to the best of our knowledge, the first such protocol to appear in the cryptographic literature.

show abstract

“…The second method used by Shoup and Gennaro [48] follows Lee and Lim paper [32], with the El Gamal [17] cryptosystem, but in the random oracle model [6]. First, they tried to add a non-interactive zero-knowledge proof of knowledge of discrete logarithm, using the Schnorr signature [44]. But they remarked that the decryption simulation without the secret key would require an exponential time, because of a combinatorial explosion of the forking lemma [39].…”

Section: Related Workmentioning

confidence: 99%

Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks

Fouque

Pointcheval

2001

Advances in Cryptology — ASIACRYPT 2001

View full text Add to dashboard Cite

Abstract. Semantic security against chosen-ciphertext attacks (IND-CCA) is widely believed as the correct security level for public-key encryption scheme. On the other hand, it is often dangerous to give to only one people the power of decryption. Therefore, threshold cryptosystems aimed at distributing the decryption ability. However, only two efficient such schemes have been proposed so far for achieving IND-CCA. Both are El Gamal-like schemes and thus are based on the same intractability assumption, namely the Decisional Diffie-Hellman problem. In this article we rehabilitate the twin-encryption paradigm proposed by Naor and Yung to present generic conversions from a large family of (threshold) IND-CPA scheme into a (threshold) IND-CCA one in the random oracle model. An efficient instantiation is also proposed, which is based on the Paillier cryptosystem. This new construction provides the first example of threshold cryptosystem secure against chosen-ciphertext attacks based on the factorization problem. Moreover, this construction provides a scheme where the "homomorphic properties" of the original scheme still hold. This is rather cumbersome because homomorphic cryptosystems are known to be malleable and therefore not to be CCA secure. However, we do not build a "homomorphic cryptosystem", but just keep the homomorphic properties.

show abstract

Efficient Identification and Signatures for Smart Cards

Cited by 964 publications

References 6 publications

Incremental Cryptography: The Case of Hashing and Signing

Incremental Cryptography: The Case of Hashing and Signing

A security solution for IEEE 802.11's ad hoc mode: password-authentication and group Diffie Hellman key exchange

Threshold Cryptosystems Secure against Chosen-Ciphertext Attacks

Contact Info

Product

Resources

About