Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Reductions among number theoretic problems
Information and Computation
An interactive identification scheme based on discrete logarithms and factoring (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the fly signatures based on factoring
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Verifiable Partial Escrow of Integer Factors
Designs, Codes and Cryptography
A Signature Scheme Based on the Intractability of Computing Roots
Designs, Codes and Cryptography
A New \mathcal{NP}-Complete Problem and Public-Key Identification
Designs, Codes and Cryptography
Attacks Based on Small Factors in Various Group Structures
ACISP '01 Proceedings of the 6th Australasian Conference on Information Security and Privacy
Verifiable Partial Sharing of Integer Fractions
SAC '98 Proceedings of the Selected Areas in Cryptography
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Efficient "on the Fly" Signature Schemes Based on Integer Factoring
INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Cryptoanalysis in Prime Order Subgroups of Z*n
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A Group Signature Scheme with Improved Efficiency
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Coupon Recalculation for the GPS Authentication Scheme
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Efficient zero-knowledge identification schemes which respect privacy
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Chosen-Ciphertext Secure RSA-Type Cryptosystems
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Server(prover/signer)-aided verification of identity proofs and signatures
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Searching for compact algorithms: CGEN
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Another look at small RSA exponents
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
New signature schemes with coupons and tight reduction
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
An efficient CDH-based signature scheme with a tight security reduction
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Pairings on elliptic curves over finite commutative rings
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Tightly-Secure signatures from lossy identification schemes
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
We first describe a modification of Schnorr's identification scheme, in which the modulus is composite (instead of prime). This modification has some similarity with Brickell-McCurky's one, presented at the same conference. Then, by establishing a new set-up, we derive the first identity-based identification scheme based on discrete logarithms. More precisely, it is based on discrete logarithm modulo a composite number, a problem known to be harder than factorization problem. This scheme has interesting and somewhat paradoxical features. In particular, any user can choose his own secret, and, provided the parameters have convenient sizes, even the trusted center is unable to retrieve it from the public key (contrary to any identity-based scheme known until now).