159
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
The well-known Signed ElGamal scheme consists of ElGamal encryption with a non-interactive Schnorr proof of knowledge. While this scheme should be intuitively secure against chosen...
175
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Functional encryption (FE) supports constrained decryption keys that allow decrypters to learn specific functions of encrypted messages. In numerous practical applications of FE, ...
296
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
We formally study “non-malleable functions” (NMFs), a general cryptographic primitive which simplifies and relaxes “non-malleable one-way/hash functions” (NMOWHFs) introd...
181
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
We propose generic constructions of public-key encryption schemes, satisfying key-dependent message (KDM) security for projections and different forms of key-leakage resilience, f...
159
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Key-insulated encryption is one of the effective solutions to a key exposure problem. Recently, identity-based encryption (IBE) has been used as one of fundamental cryptographic p...
163
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Abstract. Three approaches are currently used for devising identitybased encryption schemes. They respectively build on pairings, quadratic residues (QR), and lattices. Among them,...
159
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Message authentication and key exchange are two of the most basic tasks of cryptography. Solutions based on public-key infrastructure (PKI) are prevalent. Still, the state of the ...
161
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
This work introduces XMSS-T, a new stateful hash-based signature scheme with tight security. Previous hash-based signatures are facing a loss of security, linear in performance par...
155
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Several well-known public key encryption schemes, including those of Alekhnovich (FOCS 2003), Regev (STOC 2005), and Gentry, Peikert and Vaikuntanathan (STOC 2008), rely on the co...
160
click to vote
PKC
2016
Springer
10 years 3 months ago
2016
Springer
Deniable encryption, first introduced by Canetti et al. (CRYPTO 1997), allows a sender and/or receiver of encrypted communication to produce fake but authentic-looking coins and/o...