The following pages link to (Q3374926):
Displaying 39 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Improved algebraic MACs and practical keyed-verification anonymous credentials (Q1698653) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Dual-mode NIZKs: possibility and impossibility results for property transfer (Q2152070) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials (Q2423846) (← links)
- Concurrent zero knowledge, revisited (Q2442650) (← links)
- Secure parameterized pattern matching (Q2663480) (← links)
- Lattice-based e-cash, revisited (Q2692386) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Designated Confirmer Signatures with Unified Verification (Q3104715) (← links)
- Compact E-Cash and Simulatable VRFs Revisited (Q3392907) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Anonymous Authentication with Optional Shared Anonymity Revocation and Linkability (Q3452236) (← links)
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems (Q3623053) (← links)
- On the Portability of Generalized Schnorr Proofs (Q3627449) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- New Constructions and Applications of Trapdoor DDH Groups (Q4916024) (← links)
- Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption (Q4975186) (← links)
- Improved Constructions of Anonymous Credentials from Structure-Preserving Signatures on Equivalence Classes (Q5087265) (← links)
- Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model (Q5087275) (← links)
- Group Encryption (Q5387099) (← links)
- Equivocal Blind Signatures and Adaptive UC-Security (Q5445514) (← links)
- Threshold Homomorphic Encryption in the Universally Composable Cryptographic Library (Q5505478) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918439) (← links)
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices (Q5918662) (← links)
