Pages that link to "Item:Q3777940"
From MaRDI portal
The following pages link to How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940):
Displaying 50 items.
- Improving speed and security in updatable encryption schemes (Q2691598) (← links)
- Non-interactive composition of sigma-protocols via Share-then-Hash (Q2691604) (← links)
- Succinct Diophantine-satisfiability arguments (Q2691605) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices (Q2692392) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Post-quantum resettably-sound zero knowledge (Q2695624) (← links)
- Tight security bounds for Micali's SNARGs (Q2695642) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Simple and efficient batch verification techniques for verifiable delay functions (Q2697899) (← links)
- OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss (Q2697915) (← links)
- Inner-product functional encryption from random linear codes: trial and challenges (Q2697925) (← links)
- Identification scheme and forward-secure signature in identity-based setting from isogenies (Q2697929) (← links)
- Efficient attribute-based signature for monotone predicates (Q2697932) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Zero-Knowledge Authenticated Order Queries and Order Statistics on a List (Q2794500) (← links)
- Two-Round Man-in-the-Middle Security from LPN (Q2796127) (← links)
- On the Correlation Intractability of Obfuscated Pseudorandom Functions (Q2796135) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Post-Quantum Cryptography: State of the Art (Q2803619) (← links)
- Towards Lightweight Anonymous Entity Authentication for IoT Applications (Q2817466) (← links)
- Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry (Q2817804) (← links)
- Identity-Based Group Encryption (Q2817806) (← links)
- Verifiable Multi-party Computation with Perfectly Private Audit Trail (Q2822682) (← links)
- Naor-Yung Paradigm with Shared Randomness and Applications (Q2827710) (← links)
- Zero-Knowledge Made Easy so It Won’t Make You Dizzy (Q2827719) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
- Efficient Schemes for Anonymous Yet Authorized and Bounded Use of Cloud Resources (Q2889864) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- Signatures and Efficient Proofs on Committed Graphs and NP-Statements (Q2948189) (← links)
- Simple-Yet-Efficient Construction and Revocation of Group Signatures (Q2949726) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience (Q2958151) (← links)
- A new certificateless multiple key agreement scheme (Q2966501) (← links)
- Identity-Based Cryptosystems and Signature Schemes (Q2974478) (← links)
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness (Q2988351) (← links)
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem (Q3084253) (← links)
- One-Time Signatures and Chameleon Hash Functions (Q3084263) (← links)
- Efficient Identity-Based Signcryption in the Standard Model (Q3092353) (← links)
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures (Q3092357) (← links)
- Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model (Q3092365) (← links)
- Towards Restricting Plaintext Space in Public Key Encryption (Q3098005) (← links)
