Publication:4394211
From MaRDI portal
zbMath0903.94025MaRDI QIDQ4394211
Publication date: 11 June 1998
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory
Related Items
Cryptographic Voting — A Gentle Introduction, Extended security arguments for signature schemes, Asymmetric group message franking: definitions and constructions, Zero-knowledge arguments for subverted RSA groups, An accurate, scalable and verifiable protocol for federated differentially private averaging, Vector commitments over rings and compressed \(\varSigma \)-protocols, Secure multiparty computation from threshold encryption based on class groups, On the impossibility of algebraic NIZK in pairing-free groups, Concurrent knowledge extraction in public-key models, Tightly secure signatures from lossy identification schemes, Two-server password-only authenticated key exchange, Several cryptographic applications of \(\Sigma\)-protocol, A framework for non-interactive instance-dependent commitment schemes (NIC), Bounded tamper resilience: how to go beyond the algebraic barrier, Resource fairness and composability of cryptographic protocols, Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring, Zero-knowledge proofs of knowledge for group homomorphisms, A note on universal composable zero-knowledge in the common reference string model, On the tightness of forward-secure signature reductions, Adaptively secure distributed public-key systems., Formalising \(\varSigma\)-protocols and commitment schemes using crypthol, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Covert authentication from lattices, Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics, Non-malleable functions and their applications, A compressed \(\varSigma \)-protocol theory for lattices, Compressing proofs of \(k\)-out-of-\(n\) partial knowledge, Logarithmic-size ring signatures with tight security from the DDH assumption, Non-interactive composition of sigma-protocols via Share-then-Hash, Acyclicity programming for sigma-protocols, Improved OR-Composition of Sigma-Protocols, Anonymous Authentication with Spread Revelation, Secure Authenticated Comparisons, Towards Restricting Plaintext Space in Public Key Encryption, Efficiency Limitations for Σ-Protocols for Group Homomorphisms, Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage, Unifying Zero-Knowledge Proofs of Knowledge
