Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
From MaRDI portal
Publication:499658
DOI10.1007/S10623-014-9986-9zbMATH Open1347.94053OpenAlexW2126197338WikidataQ122696523 ScholiaQ122696523MaRDI QIDQ499658FDOQ499658
Authors: Ryo Nishimaki, Keita Xagawa 
Publication date: 30 September 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-014-9986-9
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
decisional linear assumptionencrypted verifiably encrypted signatureobfuscationverifiably encrypted signature
Cites Work
- Fully homomorphic encryption with polylog overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Implementing Gentry's fully-homomorphic encryption scheme
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption over the integers with shorter public keys
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Short signatures from the Weil pairing
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Identity-Based Encryption from the Weil Pairing
- Efficient Identity-Based Encryption Without Random Oracles
- (Leveled) fully homomorphic encryption without bootstrapping
- Commuting signatures and verifiable encryption
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- Title not available (Why is that?)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Advances in Cryptology – CRYPTO 2004
- Randomizable Proofs and Delegatable Anonymous Credentials
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Optimistic fair exchange of digital signatures
- Public Key Cryptography - PKC 2006
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Optimistic Fair Exchange in a Multi-user Setting
- Correcting errors without leaking partial information
- Obfuscation for cryptographic purposes
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Title not available (Why is that?)
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- On symmetric encryption and point obfuscation
- Obfuscation of hyperplane membership
- Secure obfuscation for encrypted signatures
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- On obfuscating point functions
- On strong simulation and composable point obfuscation
- On Best-Possible Obfuscation
- Non-malleable Obfuscation
- Verifiably encrypted signatures from RSA without NIZKs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Candidate Multilinear Maps from Ideal Lattices
- Batch fully homomorphic encryption over the integers
- Injective encodings to elliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- On the (im)possibility of obfuscating programs
- Progress in Cryptology - INDOCRYPT 2003
- Obfuscating Point Functions with Multibit Output
- Boneh et al.'s \(k\)-element aggregate extraction assumption is equivalent to the Diffie-Hellman assumption
- Securely obfuscating re-encryption
Cited In (6)
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES
- Generic constructions for verifiably encrypted signatures without random oracles or NIZKs
- Verifiably encrypted signatures from RSA without NIZKs
- TVES: threshold verifiably encrypted signature and its applications
- Verifiably encrypted group signatures
- Verifiably encrypted signatures: security revisited and a new construction
Uses Software
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)
