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-9zbMath1347.94053OpenAlexW2126197338WikidataQ122696523 ScholiaQ122696523MaRDI QIDQ499658
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
decisional linear assumptionencrypted verifiably encrypted signatureobfuscationverifiably encrypted signature
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Securely obfuscating re-encryption
- Short signatures from the Weil pairing
- Obfuscation for cryptographic purposes
- Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- (Leveled) fully homomorphic encryption without bootstrapping
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Functional Re-encryption and Collusion-Resistant Obfuscation
- Fully Homomorphic Encryption with Polylog Overhead
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Implementing Gentry’s Fully-Homomorphic Encryption Scheme
- Commuting Signatures and Verifiable Encryption
- Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
- Randomizable Proofs and Delegatable Anonymous Credentials
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles
- On Symmetric Encryption and Point Obfuscation
- Obfuscation of Hyperplane Membership
- Fully Homomorphic Encryption over the Integers
- Secure Obfuscation for Encrypted Signatures
- Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
- On obfuscating point functions
- Correcting errors without leaking partial information
- On Strong Simulation and Composable Point Obfuscation
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- On Best-Possible Obfuscation
- Non-malleable Obfuscation
- Verifiably Encrypted Signatures from RSA without NIZKs
- Optimistic fair exchange of digital signatures
- Identity-Based Encryption from the Weil Pairing
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Candidate Multilinear Maps from Ideal Lattices
- Batch Fully Homomorphic Encryption over the Integers
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Injective Encodings to Elliptic Curves
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- On the (im)possibility of obfuscating programs
- Progress in Cryptology - INDOCRYPT 2003
- Obfuscating Point Functions with Multibit Output
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Optimistic Fair Exchange in a Multi-user Setting
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - ASIACRYPT 2003
This page was built for publication: Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES