New techniques for SPHFs and efficient one-round PAKE protocols
Password-authenticated key exchange (PAKE) protocols allow two players to agree on a
shared high entropy secret key, that depends on their own passwords only. Following the …
shared high entropy secret key, that depends on their own passwords only. Following the …
A new framework for efficient password-based authenticated key exchange
Protocols for password-based authenticated key exchange (PAKE) allow two users who
share only a short, low-entropy password to agree on a cryptographically strong session …
share only a short, low-entropy password to agree on a cryptographically strong session …
A new general framework for secure public key encryption with keyword search
Abstract Public Key Encryption with Keyword Search (PEKS), introduced by Boneh et al. in
Eurocrypt'04, allows users to search encrypted documents on an untrusted server without …
Eurocrypt'04, allows users to search encrypted documents on an untrusted server without …
Two-round PAKE from approximate SPH and instantiations from lattices
J Zhang, Y Yu - Advances in Cryptology–ASIACRYPT 2017: 23rd …, 2017 - Springer
Password-based authenticated key exchange (PAKE) enables two users with shared low-
entropy passwords to establish cryptographically strong session keys over insecure …
entropy passwords to establish cryptographically strong session keys over insecure …
Public‐key encryption indistinguishable under plaintext‐checkable attacks
M Abdalla, F Benhamouda… - IET Information …, 2016 - Wiley Online Library
Indistinguishability under chosen‐ciphertext attack (IND‐CCA) is now considered the de
facto security notion for public‐key encryption. However, this sometimes offers a stronger …
facto security notion for public‐key encryption. However, this sometimes offers a stronger …
Hash proof systems over lattices revisited
Abstract Hash Proof Systems or Smooth Projective Hash Functions (SPHFs) are a form of
implicit arguments introduced by Cramer and Shoup at Eurocrypt'02. They have found many …
implicit arguments introduced by Cramer and Shoup at Eurocrypt'02. They have found many …
CCA-secure inner-product functional encryption from projective hash functions
In an inner-product functional encryption scheme, the plaintexts are vectors and the owner of
the secret key can delegate the ability to compute weighted sums of the coefficients of the …
the secret key can delegate the ability to compute weighted sums of the coefficients of the …
Cryptographic reverse firewall via malleable smooth projective hash functions
Motivated by the revelations of Edward Snowden, post-Snowden cryptography has become
a prominent research direction in recent years. In Eurocrypt 2015, Mironov and Stephens …
a prominent research direction in recent years. In Eurocrypt 2015, Mironov and Stephens …
Disjunctions for hash proof systems: New constructions and applications
Abstract Hash Proof Systems were first introduced by Cramer and Shoup (Eurocrypt'02) as a
tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they …
tool to construct efficient chosen-ciphertext-secure encryption schemes. Since then, they …
Provably secure key-aggregate cryptosystems with broadcast aggregate keys for online data sharing on the cloud
S Patranabis, Y Shrivastava… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Online data sharing for increased productivity and efficiency is one of the primary
requirements today for any organization. The advent of cloud computing has pushed the …
requirements today for any organization. The advent of cloud computing has pushed the …