The following pages link to (Q4035738):
Displaying 50 items.
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Automated proofs for asymmetric encryption (Q540682) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- A short non-delegatable strong designated verifier signature (Q893866) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Group homomorphic encryption: characterizations, impossibility results, and applications (Q1943979) (← links)
- Secure integration of asymmetric and symmetric encryption schemes (Q1946596) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Towards witness encryption without multilinear maps (Q2104410) (← links)
- Generic transformation from broadcast encryption to round-optimal deniable ring authentication (Q2115719) (← links)
- SimS: a simplification of SiGamal (Q2118549) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions (Q2210433) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Security models and proof strategies for plaintext-aware encryption (Q2442648) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- A new framework for deniable secure key exchange (Q2672249) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Practical dynamic group signatures without knowledge extractors (Q2692957) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- On CCA-Secure Somewhat Homomorphic Encryption (Q2889863) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption (Q3194601) (← links)
- Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
- On the Necessary and Sufficient Assumptions for UC Computation (Q3408190) (← links)
- A Brief History of Provably-Secure Public-Key Encryption (Q3506393) (← links)
- Succinct NP Proofs from an Extractability Assumption (Q3507432) (← links)
- Relationship between Two Approaches for Defining the Standard Model PA-ness (Q3511156) (← links)
- Cramer-Shoup Satisfies a Stronger Plaintext Awareness under a Weaker Assumption (Q3540039) (← links)
- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model (Q3593102) (← links)
- A New Randomness Extraction Paradigm for Hybrid Encryption (Q3627459) (← links)
- On characterizations of escrow encryption schemes (Q4571999) (← links)
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks (Q4933209) (← links)
- A New Paradigm for Public-Key Functional Encryption for Degree-2 Polynomials (Q5041154) (← links)
- Master-Key KDM-Secure IBE from Pairings (Q5041155) (← links)
- Toward RSA-OAEP Without Random Oracles (Q5041161) (← links)