Titlebook: Information Security and Privacy; 22nd Australasian Co Josef Pieprzyk,Suriadi Suriadi Conference proceedings 2017 Springer International Pu

重疊

intrigue

輕快帶來危險(xiǎn)

KDM-Secure Public-Key Encryption from Constant-Noise LPNraic structure. Over the years, constructions of different public-key primitives were proposed from LPN, but most of them are based on the LPN assumption with . rate rather than . rate. A recent breakthrough was made by Yu and Zhang (Crypto’16), who constructed the first Public-Key Encryption (PKE)

討好美人

Long-Term Secure Commitments via Extractable-Binding Commitments used commitment schemes is threatened in the long-term, when adversaries become computationally much more powerful. We improve over this situation by putting forward a new notion of commitment schemes, so called .. These schemes allow for long-term protection because they allow to adjust the protec

有權(quán)

New Proof Techniques for DLIN-Based Adaptively Secure Attribute-Based Encryptionrmula .. Thus our KP-(resp.?CP-)ABE has non-redundant ciphertexts (resp.?secret keys). For achieving the results, we develop a new encoding method for access policy matrix for ABE, by . into its matrix and randomness, and . the LSS shares in simulation. The new techniques are of independent interest

JEER

COMA

保守

escalate

文字

Lattice-Based Revocable Identity-Based Encryption with Bounded Decryption Key Exposure Resistancedynamically and efficiently. To capture a realistic scenario, Seo and Emura introduced an additional important security notion, called . (DKER), where an adversary is allowed to query short-term decryption keys. Although several RIBE schemes that satisfy DKER have been proposed, all the lattice-base