The following pages link to On Signatures of Knowledge (Q5756623):
Displaying 45 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Unconditionally anonymous ring and mesh signatures (Q321307) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Several cryptographic applications of \(\Sigma\)-protocol (Q473026) (← links)
- Protecting the privacy of voters: new definitions of ballot secrecy for e-voting (Q832400) (← links)
- Graded signatures (Q1799239) (← links)
- Universal witness signatures (Q1800730) (← links)
- Classical proofs of quantum knowledge (Q2056758) (← links)
- Witness authenticating NIZKs and applications (Q2139626) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Issuer-hiding attribute-based credentials (Q2149822) (← links)
- Logarithmic-size ring signatures with tight security from the DDH assumption (Q2167754) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- Efficient attribute-based signature for monotone predicates (Q2697932) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Short Attribute-Based Signatures for Threshold Predicates (Q2889994) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- Identity Based Group Signatures from Hierarchical Identity-Based Encryption (Q3392909) (← links)
- Unlinkable Randomizable Signature and Its Application in Group Signature (Q3600344) (← links)
- Witness Maps and Applications (Q5041158) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
- Sanitizable Signatures Revisited (Q5502753) (← links)
- One-Shot Verifiable Encryption from Lattices (Q5738881) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q6041582) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Multimodal private signatures (Q6104359) (← links)
- Count me in! Extendability for threshold ring signatures (Q6113963) (← links)
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable? (Q6134856) (← links)
- YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model (Q6135416) (← links)
- A universally composable non-interactive aggregate cash system (Q6135420) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)
- Improving the efficiency of report and trace ring signatures (Q6155241) (← links)
- Bicameral and auditably private signatures (Q6562571) (← links)
- A generic construction of an anonymous reputation system and instantiations from lattices (Q6562575) (← links)
- Witness-authenticated key exchange, revisited: extensions to groups, improved models, simpler constructions (Q6573953) (← links)
- From polynomial IOP and commitments to non-malleable zkSNARKs (Q6582227) (← links)
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach (Q6582228) (← links)
- Selective delegation of attributes in mercurial signature credentials (Q6595944) (← links)
- \textsf{ZKAttest}: ring and group signatures for existing ECDSA keys (Q6618583) (← links)
- PURED: a unified framework for resource-hard functions (Q6623350) (← links)
