scientific article; zbMATH DE number 1162684
From MaRDI portal
Publication:4394211
zbMath0903.94025MaRDI QIDQ4394211
Publication date: 11 June 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02)
Related Items (37)
Non-malleable functions and their applications ⋮ Concurrent knowledge extraction in public-key models ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Compressing proofs of \(k\)-out-of-\(n\) partial knowledge ⋮ Tightly secure signatures from lossy identification schemes ⋮ Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage ⋮ Anonymous Authentication with Spread Revelation ⋮ Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Zero-knowledge proofs of knowledge for group homomorphisms ⋮ 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 ⋮ Two-server password-only authenticated key exchange ⋮ 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 ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Acyclicity programming for sigma-protocols ⋮ On the tightness of forward-secure signature reductions ⋮ Resource fairness and composability of cryptographic protocols ⋮ Several cryptographic applications of \(\Sigma\)-protocol ⋮ A framework for non-interactive instance-dependent commitment schemes (NIC) ⋮ Secure Authenticated Comparisons ⋮ Bounded tamper resilience: how to go beyond the algebraic barrier ⋮ Formalising \(\varSigma\)-protocols and commitment schemes using crypthol ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Extended security arguments for signature schemes ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Unifying Zero-Knowledge Proofs of Knowledge ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Towards Restricting Plaintext Space in Public Key Encryption ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Cryptographic Voting — A Gentle Introduction ⋮ Covert authentication from lattices ⋮ Adaptively secure distributed public-key systems. ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
This page was built for publication:
