On Signatures of Knowledge
From MaRDI portal
Publication:5756623
DOI10.1007/11818175_5zbMath1129.94043OpenAlexW2104648615MaRDI QIDQ5756623
Melissa Chase, Anna Lysyanskaya
Publication date: 4 September 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11818175_5
Related Items
Short Attribute-Based Signatures for Threshold Predicates, Witness Maps and Applications, Protecting the privacy of voters: new definitions of ballot secrecy for e-voting, Signatures of Knowledge for Boolean Circuits Under Standard Assumptions, Witness authenticating NIZKs and applications, Policy-based signature scheme from lattices, Signatures of knowledge for Boolean circuits under standard assumptions, Unconditionally anonymous ring and mesh signatures, Issuer-hiding attribute-based credentials, Logarithmic-size ring signatures with tight security from the DDH assumption, Group signatures and more from isogenies and lattices: generic, simple, and efficient, One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model, Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes, Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Spartan and bulletproofs are simulation-extractable (for free!), Structure-preserving compilers from new notions of obfuscations, Extendable threshold ring signatures with enhanced anonymity, NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion, Universal Composition with Responsive Environments, Asymmetric group message franking: definitions and constructions, Multimodal private signatures, DualDory: logarithmic-verifier linkable ring signatures through preprocessing, Count me in! Extendability for threshold ring signatures, What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?, YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model, A universally composable non-interactive aggregate cash system, Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees, Improving the efficiency of report and trace ring signatures, Leakproof secret sharing protocols with applications to group identification scheme, Efficient attribute-based signature for monotone predicates, Several cryptographic applications of \(\Sigma\)-protocol, Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era, One-Shot Verifiable Encryption from Lattices, Group signatures and more from isogenies and lattices: generic, simple, and efficient, Unlinkable Randomizable Signature and Its Application in Group Signature, A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles, Classical proofs of quantum knowledge, Identity Based Group Signatures from Hierarchical Identity-Based Encryption, Sanitizable Signatures Revisited
