Pages that link to "Item:Q5428113"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428113):
Displaying 50 items.
- Rational Sumchecks (Q2799100) (← links)
- Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys (Q2827708) (← links)
- Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium (Q2829231) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- The Magic of ELFs (Q2835598) (← links)
- Short Attribute-Based Signatures for Threshold Predicates (Q2889994) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- A Shuffle Argument Secure in the Generic Model (Q2953798) (← links)
- Ciphertext-Policy Attribute Based Encryption Supporting Access Policy Update (Q2953847) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Delegating RAM Computations with Adaptive Soundness and Privacy (Q3181020) (← links)
- Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures (Q3392908) (← links)
- Efficient Traceable Signatures in the Standard Model (Q3392912) (← links)
- The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model (Q3593102) (← links)
- Compact Group Signatures Without Random Oracles (Q3593110) (← links)
- A New Randomness Extraction Paradigm for Hybrid Encryption (Q3627459) (← links)
- The Knowledge Complexity of Interactive Proof Systems (Q3833627) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Signatures of Knowledge for Boolean Circuits Under Standard Assumptions (Q5048960) (← links)
- Two is better than one: How to securely combine two assumptions (Q5069998) (← links)
- On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups (Q5135711) (← links)
- Breaking the Sub-Exponential Barrier in Obfustopia (Q5270361) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits (Q5738750) (← links)
- An Efficient Self-blindable Attribute-Based Credential Scheme (Q5854421) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5915839) (← links)
- Constructing tree decompositions of graphs with bounded gonality (Q5918255) (← links)
- Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness (Q5918360) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← links)
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
- Rate-1 incompressible encryption from standard assumptions (Q6114264) (← links)
- Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG (Q6157544) (← links)
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption (Q6163657) (← links)
- Constructive post-quantum reductions (Q6163970) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- PointProofs, revisited (Q6175975) (← links)
- Signature Schemes with Randomized Verification (Q6487210) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q6570525) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)
- On proving equivalence class signatures secure from non-interactive assumptions (Q6635743) (← links)
- Updatable, aggregatable, succinct mercurial vector commitment from lattice (Q6635762) (← links)
- Constant-size zk-SNARKs in ROM from falsifiable assumptions (Q6637561) (← links)
- Pairing-free blind signatures from standard assumptions in the ROM (Q6648193) (← links)
