The following pages link to (Q4783745):
Displaying 49 items.
- Constant-size structure-preserving signatures: generic constructions and simple assumptions (Q321316) (← links)
- Round-optimal password-based authenticated key exchange (Q380962) (← links)
- Fully leakage-resilient signatures revisited: graceful degradation, noisy leakage, and construction in the bounded-retrieval model (Q729893) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs (Q901372) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- Leakage-resilient ring signature schemes (Q1711836) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- Leakage-resilient group signature: definitions and constructions (Q1999051) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Secure software leasing (Q2056750) (← links)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Witness authenticating NIZKs and applications (Q2139626) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- Selectively linkable group signatures -- stronger security and preserved verifiability (Q2149824) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- Continuously non-malleable secret sharing for general access structures (Q2175937) (← links)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← links)
- Continuously non-malleable codes in the split-state model (Q2210446) (← links)
- Post-challenge leakage in public-key encryption (Q2257289) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- QANIZK for adversary-dependent languages and their applications (Q2420581) (← links)
- Novel \(\Omega\)-protocols for NP (Q2480118) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Computational robust (fuzzy) extractors for CRS-dependent sources with minimal min-entropy (Q2697881) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Zero-Knowledge Accumulators and Set Algebra (Q2953773) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- Perfect Non-interactive Zero Knowledge for NP (Q3593105) (← links)
- A Discrete-Logarithm Based Non-interactive Non-malleable Commitment Scheme with an Online Knowledge Extractor (Q3600328) (← links)
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks (Q3627444) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Non-Malleable Codes from Additive Combinatorics (Q4637777) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- Tagged One-Time Signatures: Tight Security and Optimal Tag Size (Q4916017) (← links)
- Verifiable Elections That Scale for Free (Q4916026) (← links)
- (Q5002694) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- A Unified Framework for Non-universal SNARKs (Q5087272) (← links)
- Cryptography and cryptographic protocols (Q5138490) (← links)
- Completely Non-malleable Encryption Revisited (Q5445447) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
