scientific article; zbMATH DE number 708798
From MaRDI portal
Publication:4318686
zbMath0809.94008MaRDI QIDQ4318686
Publication date: 4 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols, Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources, A closer look at multiple forking: leveraging (in)dependence for a tighter bound, Does Fiat-Shamir require a cryptographic hash function?, Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares, Security of 2t-Root Identification and Signatures, New Generation of Secure and Practical RSA-Based Signatures, Fiat-Shamir for highly sound protocols is instantiable, Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, A correction to a code-based blind signature scheme, Logarithmic-size ring signatures with tight security from the DDH assumption, Short signatures from Diffie-Hellman: realizing almost compact public key, Secure electronic bills of lading: Blind counts and digital signatures, Off-line electronic cash based on secret-key certificates, Identity based identification from algebraic coding theory, Zero-knowledge proofs of knowledge for group homomorphisms, Leakage Resilience of the Blom’s Key Distribution Scheme, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Boosting the Security of Blind Signature Schemes, On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes, Threshold and multi-signature schemes from linear hash functions, Rai-Choo! Evolving blind signatures to the next level, PI-Cut-Choo and friends: compact blind signatures via parallel instance cut-and-choose and more, Sherlock Holmes zero-knowledge protocols, On pairing-free blind signature schemes in the algebraic group model, Improved straight-line extraction in the random oracle model with applications to signature aggregation, SR-MuSig2: a scalable and reconfigurable multi-signature scheme and its applications, Anamorphic signatures: secrecy from a dictator who only permits authentication!, Endemic oblivious transfer via random oracles, revisited, Snowblind: a threshold blind signature in pairing-free groups, \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation, Efficient set operations in the presence of malicious adversaries, Improved low-computation partially blind signatures., Accountable authority key policy attribute-based encryption, Identification scheme and forward-secure signature in identity-based setting from isogenies, Cryptographic reverse firewalls for interactive proof systems, Several practical protocols for authentication and key exchange, Bounded tamper resilience: how to go beyond the algebraic barrier, A new framework for the design and analysis of identity-based identification schemes, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, Efficient non-malleable commitment schemes, New receipt-free voting scheme using double-trapdoor commitment, A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials, A fair and efficient solution to the socialist millionaires' problem, Lower bounds for non-black-box zero knowledge, Efficient non-malleable commitment schemes, On the unlinkability of randomization-enhanced Chaum's blind signature scheme, Proxy blind multi-signature scheme without a secure channel, A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor, Hash Functions from Sigma Protocols and Improvements to VSH, Delegating a product of group exponentiations with application to signature schemes, Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures, Lattice-Based Identification Schemes Secure Under Active Attacks, Equivocal Blind Signatures and Adaptive UC-Security, \(k\)-critical graphs in \(P_5\)-free graphs, Realizing Hash-and-Sign Signatures under Standard Assumptions, One-Time Signatures and Chameleon Hash Functions, Signatures from sequential-OR proofs, A Schnorr-Like Lightweight Identity-Based Signature Scheme, Unifying Zero-Knowledge Proofs of Knowledge, Fiat–Shamir for Highly Sound Protocols Is Instantiable, Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions, Security proofs for identity-based identification and signature schemes, Optimal Security Proofs for Signatures from Identification Schemes, Leakage-Resilient Signatures, Simple Schnorr multi-signatures with applications to bitcoin, Converting normal DLP-based signatures into blind, Digital Signatures, A rational threshold signature model and protocol based on different permissions, Anonymous tokens with private metadata bit, Lattice-based blind signatures, revisited, Improving the exact security of digital signature schemes, Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
