Separating succinct non-interactive arguments from all falsifiable assumptions
From MaRDI portal
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Cryptography (94A60)
Recommendations
Cited in
(only showing first 100 items - show all)- Ciphertext expansion in limited-leakage order-preserving encryption: a tight computational lower bound
- On the statistical leak of the GGH13 multilinear map and some variants
- The wonderful world of global random oracles
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- Practical homomorphic message authenticators for arithmetic circuits
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- On subversion-resistant SNARKs
- Compact designated verifier NIZKs from the CDH assumption without pairings
- Low error efficient computational extractors in the CRS model
- Generic-group delay functions require hidden-order groups
- Compact NIZKs from standard assumptions on bilinear maps
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- Boosting verifiable computation on encrypted data
- Classical vs quantum random oracles
- Impossibility on tamper-resilient cryptography with uniqueness properties
- On publicly-accountable zero-knowledge and small shuffle arguments
- Leakage-resilient key exchange and two-seed extractors
- Incompressible encodings
- Verifiable registration-based encryption
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages
- MuSig2: simple two-round Schnorr multi-signatures
- Improved computational extractors and their applications
- Succinct non-interactive arguments via linear interactive proofs
- Non-interactive batch arguments for NP from standard assumptions
- Signatures of knowledge for Boolean circuits under standard assumptions
- Somewhere statistically binding commitment schemes with applications
- Another look at extraction and randomization of Groth's zk-SNARK
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- Practical witness-key-agreement for blockchain-based dark pools financial trading
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- SNARGs for P from sub-exponential DDH and QR
- Succinct arguments in the quantum random oracle model
- Permuted puzzles and cryptographic hardness
- On the (In)security of Kilian-based SNARGs
- Computational fuzzy extractors
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- A compiler for multi-key homomorphic signatures for Turing machines
- The magic of ELFs
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Succinct functional commitment for a large class of arithmetic circuits
- On the adaptive security of MACs and PRFs
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Statistical ZAPs from group-based assumptions
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- On expected polynomial runtime in cryptography
- The cost of adaptivity in security games on graphs
- Vector and functional commitments from lattices
- Lower bounds on assumptions behind indistinguishability obfuscation
- Cryptographic assumptions: a position paper
- Onion ORAM: a constant bandwidth blowup oblivious RAM
- Rational sumchecks
- Constrained PRFs for unbounded inputs with short keys
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Advice lower bounds for the dense model theorem
- On the existence of extractable one-way functions
- Spooky Encryption and Its Applications
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- The Magic of ELFs
- The chain rule for HILL pseudoentropy, revisited
- Unifying leakage classes: simulatable leakage and pseudoentropy
- Metric pseudoentropy: characterizations, transformations and applications
- On the Complexity of Breaking Pseudoentropy
- On the (in)security of SNARKs in the presence of oracles
- Simulating auxiliary inputs, revisited
- Pseudoentropy: lower-bounds for chain rules and transformations
- Towards non-black-box separations of public key encryption and one way function
- A counterexample to the chain rule for conditional HILL entropy
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Succinct NP Proofs from an Extractability Assumption
- Multikey fully homomorphic encryption and applications
- On the connection between leakage tolerance and adaptive security
- Constant-round interactive proofs for delegating computation
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- On QA-NIZK in the BPK model
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions
- On the classification of knowledge-of-exponent assumptions in cyclic groups
- Lattice-based SNARGs and their application to more efficient obfuscation
- Minicrypt primitives with algebraic structure and applications
- Adaptively secure MPC with sublinear communication complexity
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Security Analysis of CPace
- Proof-carrying data from arithmetized random oracles
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- A survey of elliptic curves for proof systems
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Locally verifiable signature and key aggregation
- Function-Dependent Commitments for Verifiable Multi-party Computation
- NIZK from SNARGs
- Parallelizable delegation from LWE
This page was built for publication: Separating succinct non-interactive arguments from all falsifiable assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419079)
