scientific article

Jean-Jacques Quisquater, Louis Claude Guillou

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

identification complexity randomization cryptology authentication factoring zero-knowledge

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

DualRing: generic construction of ring signatures with efficient instantiations ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Tightly secure signatures from lossy identification schemes ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ Optimal resilient threshold GQ signatures ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ Identity based identification from algebraic coding theory ⋮ The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ A note on an identity-based ring signature scheme with signer verifiability ⋮ Anamorphic signatures: secrecy from a dictator who only permits authentication! ⋮ Fair exchange of valuable information: a generalised framework ⋮ Prepaid electronic cheques using public-key certificates ⋮ Identification scheme and forward-secure signature in identity-based setting from isogenies ⋮ Certificateless proxy signature from RSA ⋮ Identity-based partially blind signature in the standard model for electronic cash ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Cryptographic reverse firewalls for interactive proof systems ⋮ Identity-based ring signatures from RSA ⋮ Generic Fully Simulatable Adaptive Oblivious Transfer ⋮ Identification Schemes from Key Encapsulation Mechanisms ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ A new framework for the design and analysis of identity-based identification schemes ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Tighter Reductions for Forward-Secure Signature Schemes ⋮ An efficient online/offline ID-based short signature procedure using extended chaotic maps ⋮ New identity-based society oriented signature schemes from pairings on elliptic curves ⋮ Lower bounds for non-black-box zero knowledge ⋮ Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks ⋮ Formal and Precise Analysis of Soundness of Several Shuffling Schemes ⋮ Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles ⋮ Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Cryptanalysis of ``an identity-based society oriented signature scheme with anonymous signers ⋮ Efficient Identity-Based Signcryption in the Standard Model ⋮ Two-party adaptor signatures from identification schemes ⋮ More efficient digital signatures with tight multi-user security ⋮ Security proofs for identity-based identification and signature schemes ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ On the Security of Online/Offline Signatures and Multisignatures from ACISP’06 ⋮ How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions ⋮ An identity-based society oriented signature scheme with anonymous signers. ⋮ Proxy signature schemes based on factoring ⋮ Improving the exact security of digital signature schemes