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.
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- Fully-succinct publicly verifiable delegation from constant-size assumptions (Q2695648) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Vector and functional commitments from lattices (Q2697903) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM (Q2799094) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- Advice lower bounds for the dense model theorem (Q2828224) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- The Magic of ELFs (Q2835598) (← links)
- The Chain Rule for HILL Pseudoentropy, Revisited (Q2946442) (← links)
- Unifying Leakage Classes: Simulatable Leakage and Pseudoentropy (Q2947523) (← links)
- Metric Pseudoentropy: Characterizations, Transformations and Applications (Q2947525) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Simulating Auxiliary Inputs, Revisited (Q3179356) (← links)
- Pseudoentropy: Lower-Bounds for Chain Rules and Transformations (Q3179357) (← links)
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← links)
- On QA-NIZK in the BPK Model (Q5041171) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups (Q5135711) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge (Q6045075) (← links)
- Security Analysis of CPace (Q6045079) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
- Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Function-Dependent Commitments for Verifiable Multi-party Computation (Q6108843) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions (Q6157543) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Augmented random oracles (Q6163941) (← links)
