Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428113
DOI10.1007/b11817zbMath1122.94391OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428113
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Related Items (96)
MuSig2: simple two-round Schnorr multi-signatures ⋮ Short Attribute-Based Signatures for Threshold Predicates ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ Structure-preserving signatures and commitments to group elements ⋮ On the security loss of unique signatures ⋮ Signatures of Knowledge for Boolean Circuits Under Standard Assumptions ⋮ 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 ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Unprovable security of perfect NIZK and non-interactive non-malleable commitments ⋮ Two is better than one: How to securely combine two assumptions ⋮ Secret-sharing for NP ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Permuted puzzles and cryptographic hardness ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ On the implausibility of differing-inputs obfuscation and extractable witness encryption with auxiliary input ⋮ A Shuffle Argument Secure in the Generic Model ⋮ Ciphertext-Policy Attribute Based Encryption Supporting Access Policy Update ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Automated analysis of cryptographic assumptions in generic group models ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ NIWI and new notions of extraction for algebraic languages ⋮ Attribute-based encryption schemes with constant-size ciphertexts ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Constrained (Verifiable) Pseudorandom Function from Functional Encryption ⋮ Constructive post-quantum reductions ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Practical non-malleable codes from symmetric-key primitives in 2-split-state model ⋮ PointProofs, revisited ⋮ The hunting of the SNARK ⋮ Impossibilities in succinct arguments: black-box extraction and more ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Efficient traceable signatures in the standard model ⋮ 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 ⋮ On expected polynomial runtime in cryptography ⋮ On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ Cryptography Using Captcha Puzzles ⋮ The Knowledge Complexity of Interactive Proof Systems ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Lower bounds for non-black-box zero knowledge ⋮ The Cramer-Shoup Encryption Scheme Is Plaintext Aware in the Standard Model ⋮ Compact Group Signatures Without Random Oracles ⋮ Election control through social influence with unknown preferences ⋮ Stronger Security Notions for Decentralized Traceable Attribute-Based Signatures and More Efficient Constructions ⋮ Decomposable obfuscation: a framework for building applications of obfuscation from polynomial hardness ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Verifiable Random Functions from Standard Assumptions ⋮ Cryptographic Assumptions: A Position Paper ⋮ Rational Sumchecks ⋮ Constrained pseudorandom functions from functional encryption ⋮ Constructing tree decompositions of graphs with bounded gonality ⋮ Expedient Non-malleability Notions for Hash Functions ⋮ A New Randomness Extraction Paradigm for Hybrid Encryption ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Proofs on Encrypted Values in Bilinear Groups and an Application to Anonymity of Signatures ⋮ Efficient Traceable Signatures in the Standard Model ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Non-zero Inner Product Encryption with Short Ciphertexts and Private Keys ⋮ Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ Two-Message, Oblivious Evaluation of Cryptographic Functionalities ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ An Efficient Self-blindable Attribute-Based Credential Scheme ⋮ 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 ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages ⋮ Towards witness encryption without multilinear maps ⋮ Breaking the Sub-Exponential Barrier in Obfustopia ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation ⋮ SimS: a simplification of SiGamal ⋮ On instantiating the algebraic group model from falsifiable assumptions ⋮ Hardness of LWE on general entropic distributions
This page was built for publication: Advances in Cryptology - CRYPTO 2003
