Publication:4737235
From MaRDI portal
zbMath1055.94011MaRDI QIDQ4737235
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2332/23320045.htm
Related Items
Revisited Experimental Comparison of Node-Link and Matrix Representations, An applications of signed quadratic residues in public key cryptography, Chosen Ciphertext Secure Keyed-Homomorphic Public-Key Encryption, Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS, Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages, Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited, Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited, Weak Zero-Knowledge beyond the Black-Box Barrier, On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness, The KDM-CCA Security of REACT, Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model, Adaptive Partitioning, Faster and Shorter Password-Authenticated Key Exchange, Efficient Fully-Simulatable Oblivious Transfer, Round Optimal Universally Composable Oblivious Transfer Protocols, CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions, Improved Structure Preserving Signatures Under Standard Bilinear Assumptions, Removing Erasures with Explainable Hash Proof Systems, Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps, Multi-theorem preprocessing NIZKs from lattices, Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions, Generic constructions of integrated PKE and PEKS, Fine-grained cryptography revisited, Minicrypt primitives with algebraic structure and applications, Optimally Sound Sigma Protocols Under DCRA, Leakage-resilient identity-based cryptography from minimal assumptions, One round threshold ECDSA without roll call, Asymmetric group message franking: definitions and constructions, Almost tight multi-user security under adaptive corruptions \& leakages in the standard model, Multi-authority ABE for non-monotonic access structures, Fine-grained verifier NIZK and its applications, Zero-knowledge arguments for subverted RSA groups, Identity-based encryption in DDH hard groups, Password-authenticated key exchange from group actions, Chosen ciphertext secure keyed two-level homomorphic encryption, The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions, Witness encryption from smooth projective hashing system, Leakage-resilient \textsf{IBE}/\textsf{ABE} with optimal leakage rates from lattices, Rate-1 incompressible encryption from standard assumptions, Mix-nets from re-randomizable and replayable CCA-secure public-key encryption, NIWI and new notions of extraction for algebraic languages, Anonymous public key encryption under corruptions, Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE, Simulation-based bi-selective opening security for public key encryption, Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness, Efficient NIZKs for algebraic sets, Smooth zero-knowledge hash functions, Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits, Poly onions: achieving anonymity in the presence of churn, Public key authenticated encryption with keyword search from LWE, A note on non-interactive zero-knowledge from CDH, Almost tight multi-user security under adaptive corruptions from LWE in the standard model, Generic conversions from CPA to CCA without ciphertext expansion for threshold ABE with constant-size ciphertexts, Towards tight adaptive security of non-interactive key exchange, On the impossibility of purely algebraic signatures, Generic Construction of UC-Secure Oblivious Transfer, Non-Malleable Encryption: Simpler, Shorter, Stronger, How to Avoid Obfuscation Using Witness PRFs, One-Round Strong Oblivious Signature-Based Envelope, Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli, Fully Secure Functional Encryption for Inner Products, from Standard Assumptions, Adaptive Oblivious Transfer and Generalization, Structure-Preserving Smooth Projective Hashing, Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions, Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience, Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions, Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World, Constructions Secure Against Receiver Selective Opening and Chosen Ciphertext Attacks, Achieving IND-CCA Security for Functional Encryption for Inner Products, How to Make the Cramer-Shoup Cryptosystem Secure Against Linear Related-Key Attacks, Leakage-Resilient IND-CCA KEM from the Extractable Hash Proofs with Indistinguishability Obfuscation, Lossy Key Encapsulation Mechanism and Its Applications, Toward Compact Public Key Encryption Based on CDH Assumption via Extended Twin DH Assumption, Approximate-Deterministic Public Key Encryption from Hard Learning Problems, Receiver Selective Opening Security from Indistinguishability Obfuscation, A New General Framework for Secure Public Key Encryption with Keyword Search, Generic Construction of Bounded-Collusion IBE via Table-Based ID-to-Key Map, A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems, Public-Key Encryption Schemes with Auxiliary Inputs, Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions, Two Generic Constructions of Probabilistic Cryptosystems and Their Applications, Simplified Submission of Inputs to Protocols, Efficient Binary Conversion for Paillier Encrypted Values, An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations, Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts), Practical Chosen Ciphertext Secure Encryption from Factoring, A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks, A New Randomness Extraction Paradigm for Hybrid Encryption, Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions, Provably secure and efficient leakage-resilient certificateless signcryption scheme without bilinear pairing, Tightly secure signatures and public-key encryption, Leakage-resilient cryptography from minimal assumptions, Round-optimal password-based authenticated key exchange, Smooth projective hashing and two-message oblivious transfer, Lossy trapdoor functions from homomorphic reproducible encryption, A note on the security of KHL scheme, An algebraic framework for Diffie-Hellman assumptions, Efficient one-sided adaptively secure computation, A note on a provable secure encryption scheme, Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited, Insight of the protection for data security under selective opening attacks, A generic scheme of plaintext-checkable database encryption, Spreading alerts quietly and the subgroup escape problem, Secure public-key encryption scheme without random oracles, On the security of public key cryptosystems with a double decryption mechanism, The Kurosawa-Desmedt key encapsulation is not chosen-ciphertext secure, Efficient public key encryption with smallest ciphertext expansion from factoring, New approaches for deniable authentication, Two-round adaptively secure multiparty computation from standard assumptions, Smooth NIZK arguments, Watermarking PRFs under standard assumptions: public marking and security with extraction queries, Regular lossy functions and their applications in leakage-resilient cryptography, Super-strong RKA secure MAC, PKE and SE from tag-based hash proof system, Chosen ciphertext secure keyed-homomorphic public-key cryptosystems, Leakage-resilient CCA2-secure certificateless public-key encryption scheme without bilinear pairing, On the leakage-resilient key exchange, Hardness of \(k\)-LWE and applications in traitor tracing, Shorter quasi-adaptive NIZK proofs for linear subspaces, Leakage-resilient cryptography from puncturable primitives and obfuscation, Practical fully secure unrestricted inner product functional encryption modulo \(p\), A black-box construction of non-malleable encryption from semantically secure encryption, Reusable fuzzy extractor from the decisional Diffie-Hellman assumption, Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs, Group homomorphic encryption: characterizations, impossibility results, and applications, More constructions of lossy and correlation-secure trapdoor functions, Practical chosen ciphertext secure encryption from factoring, Secure integration of asymmetric and symmetric encryption schemes, Practical public key encryption with selective opening security for receivers, A generic construction of CCA-secure deterministic encryption, Compact designated verifier NIZKs from the CDH assumption without pairings, New constructions of statistical NIZKs: dual-mode DV-NIZKs and more, Statistical Zaps and new oblivious transfer protocols, Tightly CCA-secure inner product functional encryption scheme, Tightly-secure authenticated key exchange, revisited, The rise of Paillier: homomorphic secret sharing and public-key silent OT, Abuse resistant law enforcement access systems, Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings, Chosen ciphertext security from injective trapdoor functions, Keyed-fully homomorphic encryption without indistinguishability obfuscation, Covert authentication from lattices, (Commit-and-prove) predictable arguments with privacy, A gapless code-based hash proof system based on RQC and its applications, Shorter non-interactive zero-knowledge arguments and ZAPs for algebraic languages, Towards witness encryption without multilinear maps, Generic transformation from broadcast encryption to round-optimal deniable ring authentication, Coin-based multi-party fair exchange, On instantiating the algebraic group model from falsifiable assumptions, A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency, Receiver-anonymity in rerandomizable RCCA-secure cryptosystems resolved, Authenticated key exchange and signatures with tight security in the standard model, Verifier-based anonymous password-authenticated key exchange protocol in the standard model, Anonymity of NIST PQC round 3 KEMs, CPA-to-CCA transformation for KDM security, Witness-based searchable encryption, Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions, Non-malleable encryption: simpler, shorter, stronger, KDM security for identity-based encryption: constructions and separations, Improving the efficiency of re-randomizable and replayable CCA secure public key encryption, A new and improved paradigm for hybrid encryption secure against chosen-ciphertext attack, Novel updatable identity-based hash proof system and its applications, Identity-based encryption with leakage-amplified chosen-ciphertext attacks security, Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman, Password-authenticated group key establishment from smooth projective hash functions, Public key encryption with equality test via hash proof system, Structure-preserving public-key encryption with leakage-resilient CCA security, Strongly leakage resilient authenticated key exchange, revisited, Public key encryption resilient to leakage and tampering attacks, Strong authenticated key exchange with auxiliary inputs, Public-key encryption for protecting data in cloud system with intelligent agents against side-channel attacks, Private set intersection: new generic constructions and feasibility results, Reconciling non-malleability with homomorphic encryption, A general compiler for password-authenticated group key exchange protocol in the standard model, Simulation-based selective opening security for receivers under chosen-ciphertext attacks, A generic construction of tightly secure signatures in the multi-user setting, QANIZK for adversary-dependent languages and their applications, In search of mathematical primitives for deriving universal projective hash families, Tag-KEM/DEM: A new framework for hybrid encryption, A new approach for UC security concurrent deniable authentication, The generic construction of continuous leakage-resilient identity-based cryptosystems, PGAS: privacy-preserving graph encryption for accurate constrained shortest distance queries, Hardware security without secure hardware: how to decrypt with a password and a server, A new framework for deniable secure key exchange, Updatable all-but-one dual projective hashing and its applications, Succinct and adaptively secure ABE for ABP from \(k\)-Lin, Subvert KEM to break DEM: practical algorithm-substitution attacks on public-key encryption, Cryptographic group actions and applications, Fully-succinct publicly verifiable delegation from constant-size assumptions, Laconic private set intersection and applications, Cryptographic shallots: a formal treatment of repliable onion encryption
