Pages that link to "Item:Q5428113"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428113):
Displaying 50 items.
- Structure-preserving signatures and commitments to group elements (Q290392) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- Attribute-based encryption schemes with constant-size ciphertexts (Q417988) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Efficient traceable signatures in the standard model (Q631785) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input (Q1688409) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Election control through social influence with unknown preferences (Q2019485) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Compact NIZKs from standard assumptions on bilinear maps (Q2055661) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical ZAPR arguments from bilinear maps (Q2055670) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← 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)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages (Q2104242) (← links)
- Towards witness encryption without multilinear maps (Q2104410) (← links)
- SimS: a simplification of SiGamal (Q2118549) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← 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)
- Permuted puzzles and cryptographic hardness (Q2175950) (← links)
- Constrained pseudorandom functions from functional encryption (Q2290626) (← links)
- The magic of ELFs (Q2318089) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- Short signatures from Diffie-Hellman: realizing almost compact public key (Q2408586) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- Automated analysis of cryptographic assumptions in generic group models (Q2423840) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← 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)
- Statistical ZAPs from group-based assumptions (Q2695645) (← links)
- On expected polynomial runtime in cryptography (Q2695649) (← links)
- Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions (Q2790054) (← links)
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation (Q2796118) (← links)
- Verifiable Random Functions from Standard Assumptions (Q2796131) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
