scientific article

Publication date: 1 March 2006

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

Authentication, digital signatures and secret sharing (94A62)

Related Items (43)

Concurrent knowledge extraction in public-key models ⋮ Anonymous Authentication with Optional Shared Anonymity Revocation and Linkability ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Dual-mode NIZKs: possibility and impossibility results for property transfer ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Secure parameterized pattern matching ⋮ Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ A verifiable secret shuffle of homomorphic encryptions ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ SnarkPack: practical SNARK aggregation ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ SIDH proof of knowledge ⋮ Improved algebraic MACs and practical keyed-verification anonymous credentials ⋮ Lattice-based e-cash, revisited ⋮ Efficient set operations in the presence of malicious adversaries ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Concurrent zero knowledge, revisited ⋮ Group Encryption ⋮ Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS ⋮ New Constructions and Applications of Trapdoor DDH Groups ⋮ Equivocal Blind Signatures and Adaptive UC-Security ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ A note on universal composable zero-knowledge in the common reference string model ⋮ Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems ⋮ On the Portability of Generalized Schnorr Proofs ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ Compact E-Cash and Simulatable VRFs Revisited ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Designated Confirmer Signatures with Unified Verification ⋮ Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library ⋮ Always have a backup plan: fully secure synchronous MPC with asynchronous fallback

This page was built for publication: