Verifiably Encrypted Signatures with Short Keys Based on the Decisional Linear Problem and Obfuscation for Encrypted VES
From MaRDI portal
Publication:4916022
DOI10.1007/978-3-642-36362-7_25zbMath1314.94105MaRDI QIDQ4916022
Publication date: 19 April 2013
Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_25
decisional linear assumption; encrypted verifiably encrypted signature; obfuscation; verifiably encrypted signature
94A62: Authentication, digital signatures and secret sharing
Related Items
Blockchain-based two-party fair contract signing scheme, Accumulable Optimistic Fair Exchange from Verifiably Encrypted Homomorphic Signatures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Short signatures without random oracles and the SDH assumption in bilinear groups
- (Leveled) fully homomorphic encryption without bootstrapping
- Fully Homomorphic Encryption with Polylog Overhead
- 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
- Fully Homomorphic Encryption over the Integers
- Secure Obfuscation for Encrypted Signatures
- Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs
- Sequential Aggregate Signatures and Multisignatures Without Random Oracles
- Verifiably Encrypted Signatures from RSA without NIZKs
- Optimistic fair exchange of digital signatures
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Dual Form Signatures: An Approach for Proving Security from Static Assumptions
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption over the Integers with Shorter Public Keys
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- On the (im)possibility of obfuscating programs
- Progress in Cryptology - INDOCRYPT 2003
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Public Key Cryptography - PKC 2006
- Advances in Cryptology - ASIACRYPT 2003
