Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
From MaRDI portal
(Redirected from Publication:499658)
Recommendations
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Verifiably encrypted signatures from RSA without NIZKs
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
Cites work
- scientific article; zbMATH DE number 1583797 (Why is no real title available?)
- scientific article; zbMATH DE number 1088253 (Why is no real title available?)
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- scientific article; zbMATH DE number 1775397 (Why is no real title available?)
- (Leveled) fully homomorphic encryption without bootstrapping
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Batch fully homomorphic encryption over the integers
- Boneh et al.'s \(k\)-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption
- Candidate Multilinear Maps from Ideal Lattices
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Commuting signatures and verifiable encryption
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Correcting errors without leaking partial information
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient Identity-Based Encryption Without Random Oracles
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption over the integers with shorter public keys
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with polylog overhead
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Identity-Based Encryption from the Weil Pairing
- Implementing Gentry's fully-homomorphic encryption scheme
- Injective encodings to elliptic curves
- Non-malleable Obfuscation
- Obfuscating Point Functions with Multibit Output
- Obfuscation for cryptographic purposes
- Obfuscation of hyperplane membership
- On Best-Possible Obfuscation
- On obfuscating point functions
- On strong simulation and composable point obfuscation
- On symmetric encryption and point obfuscation
- On the (im)possibility of obfuscating programs
- Optimistic Fair Exchange in a Multi-user Setting
- Optimistic fair exchange of digital signatures
- Progress in Cryptology - INDOCRYPT 2003
- Public Key Cryptography - PKC 2006
- Randomizable Proofs and Delegatable Anonymous Credentials
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Secure obfuscation for encrypted signatures
- Securely obfuscating re-encryption
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Verifiably encrypted signatures from RSA without NIZKs
Cited in
(6)- Verifiably encrypted group signatures
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- TVES: threshold verifiably encrypted signature and its applications
- Verifiably encrypted signatures: security revisited and a new construction
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- Verifiably encrypted signatures from RSA without NIZKs
This page was built for publication: Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499658)
