Pages that link to "Item:Q5419079"
From MaRDI portal
The following pages link to Separating succinct non-interactive arguments from all falsifiable assumptions (Q5419079):
Displaying 50 items.
- A counterexample to the chain rule for conditional HILL entropy (Q332268) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Batch verifiable computation of outsourced functions (Q887441) (← links)
- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound (Q1631324) (← links)
- On the statistical leak of the GGH13 multilinear map and some variants (Q1633467) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Low error efficient computational extractors in the CRS model (Q2055616) (← links)
- Generic-group delay functions require hidden-order groups (Q2055651) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Boosting verifiable computation on encrypted data (Q2055689) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- On publicly-accountable zero-knowledge and small shuffle arguments (Q2061977) (← links)
- Leakage-resilient key exchange and two-seed extractors (Q2096493) (← links)
- Incompressible encodings (Q2096497) (← links)
- Verifiable registration-based encryption (Q2096501) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup (Q2104239) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- Improved computational extractors and their applications (Q2129010) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Somewhere statistically binding commitment schemes with applications (Q2145407) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits (Q2145410) (← links)
- Practical witness-key-agreement for blockchain-based dark pools financial trading (Q2147265) (← links)
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs (Q2163394) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Computational fuzzy extractors (Q2216116) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- A compiler for multi-key homomorphic signatures for Turing machines (Q2232614) (← links)
- The magic of ELFs (Q2318089) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy (Q2516532) (← links)
- Succinct functional commitment for a large class of arithmetic circuits (Q2691602) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
