Theory of Cryptography
From MaRDI portal
Publication:5898375
DOI10.1007/11681878zbMATH Open1113.94008OpenAlexW3149533473MaRDI QIDQ5898375FDOQ5898375
Authors: Eike Kiltz 
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11681878
Recommendations
Cited In (71)
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
- The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application
- Multimodal private signatures
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols
- Traceable receipt-free encryption
- A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
- Adaptively secure non-interactive CCA-secure threshold cryptosystems: generic framework and constructions
- Signcryption schemes with insider security in an ideal permutation model
- Efficient hybrid encryption from ID-based encryption
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Offline witness encryption with semi-adaptive security
- Group homomorphic encryption: characterizations, impossibility results, and applications
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- All-but-many encryption
- CCA-secure inner-product functional encryption from projective hash functions
- Improving practical UC-secure commitments based on the DDH assumption
- Some (in)sufficient conditions for secure hybrid encryption
- Upgrading to functional encryption
- Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
- How to protect privacy in optimistic fair exchange of digital signatures
- Group-oriented fair exchange of signatures
- Programmable hash functions and their applications
- Fully Anonymous Group Signatures Without Random Oracles
- Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
- Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts
- Identification schemes from key encapsulation mechanisms
- Two efficient tag-based encryption schemes on lattices
- Efficient Chosen Ciphertext Secure Public Key Encryption under the Computational Diffie-Hellman Assumption
- Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
- Efficient public key encryption with smallest ciphertext expansion from factoring
- Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
- Tweaking TBE/IBE to PKE Transforms with Chameleon Hash Functions
- Chosen ciphertext secure keyed-homomorphic public-key encryption
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Dynamic threshold public-key encryption with decryption consistency from static assumptions
- CCA-secure ABE using tag and pair encoding
- Efficient threshold encryption from lossy trapdoor functions
- Adaptively secure non-interactive threshold cryptosystems
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Ambiguous optimistic fair exchange: definition and constructions
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
- A Generic Construction of Integrated Secure-Channel Free PEKS and PKE
- Efficient completely non-malleable and RKA secure public key encryptions
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- New constructions of efficient simulation-sound commitments using encryption and their applications
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
- On the security of joint signature and encryption revisited
- Practical chosen ciphertext secure encryption from factoring
- Ambiguous Optimistic Fair Exchange
- Stronger security notions for decentralized traceable attribute-based signatures and more efficient constructions
- Towards tight adaptive security of non-interactive key exchange
- A generic scheme of plaintext-checkable database encryption
- Non-interactive confirmer signatures
- Tag-KEM/DEM: A new framework for hybrid encryption
- Secure-channel free searchable encryption with multiple keywords: a generic construction, an instantiation, and its implementation
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- Efficient distributed tag-based encryption and its application to group signatures with efficient distributed traceability
- Identity-Based Threshold Key-Insulated Encryption without Random Oracles
- Cryptography with auxiliary input and trapdoor from constant-noise LPN
- An algebraic framework for Diffie-Hellman assumptions
- Plaintext-checkable encryption
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Constructions of CCA-Secure Revocable Identity-Based Encryption
This page was built for publication: Theory of Cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898375)
