Probabilistic public key encryption with equality test
We present a (probabilistic) public key encryption (PKE) scheme such that when being
implemented in a bilinear group, anyone is able to check whether two ciphertexts are …
implemented in a bilinear group, anyone is able to check whether two ciphertexts are …
The twin Diffie–Hellman problem and applications
We propose a new computational problem called the twin Diffie–Hellman problem. This
problem is closely related to the usual (computational) Diffie–Hellman problem and can be …
problem is closely related to the usual (computational) Diffie–Hellman problem and can be …
Strongly secure authenticated key exchange from factoring, codes, and lattices
An unresolved problem in research on authenticated key exchange (AKE) in the public-key
setting is to construct a secure protocol against advanced attacks such as key compromise …
setting is to construct a secure protocol against advanced attacks such as key compromise …
Chosen-ciphertext security via correlated products
We initiate the study of one-wayness under correlated products. We are interested in
identifying necessary and sufficient conditions for a function f and a distribution on inputs (x …
identifying necessary and sufficient conditions for a function f and a distribution on inputs (x …
Practical chosen ciphertext secure encryption from factoring
D Hofheinz, E Kiltz - Advances in Cryptology-EUROCRYPT 2009: 28th …, 2009 - Springer
LNCS 5479 - Advances in Cryptology - EUROCRYPT 2009 Page 1 Practical Chosen Ciphertext
Secure Encryption from Factoring Dennis Hofheinz⋆ and Eike Kiltz⋆⋆ Cryptology & Information …
Secure Encryption from Factoring Dennis Hofheinz⋆ and Eike Kiltz⋆⋆ Cryptology & Information …
Efficient chosen-ciphertext security via extractable hash proofs
H Wee - Advances in Cryptology–CRYPTO 2010: 30th Annual …, 2010 - Springer
We introduce the notion of an extractable hash proof system. Essentially, this is a special
kind of non-interactive zero-knowledge proof of knowledge system where the secret keys …
kind of non-interactive zero-knowledge proof of knowledge system where the secret keys …
Towards enhancing privacy-preservation of a federated learning cnn intrusion detection system in IoT: method and empirical study
D Torre, A Chennamaneni, JY Jo, G Vyas… - ACM Transactions on …, 2024 - dl.acm.org
Enormous risks and hidden dangers of information security exist in the applications of
Internet of Things (IoT) technologies. To secure IoT software systems, software engineers …
Internet of Things (IoT) technologies. To secure IoT software systems, software engineers …
A certifying compiler for zero-knowledge proofs of knowledge based on σ-protocols
Zero-knowledge proofs of knowledge (ZK-PoK) are important building blocks for numerous
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …
cryptographic applications. Although ZK-PoK have a high potential impact, their real world …
On the joint security of encryption and signature, revisited
KG Paterson, JCN Schuldt, M Stam… - … Conference on the Theory …, 2011 - Springer
We revisit the topic of joint security for combined public key schemes, wherein a single
keypair is used for both encryption and signature primitives in a secure manner. While …
keypair is used for both encryption and signature primitives in a secure manner. While …
Simple and efficient public-key encryption from computational Diffie-Hellman in the standard model
This paper proposes practical chosen-ciphertext secure public-key encryption systems that
are provably secure under the computational Diffie-Hellman assumption, in the standard …
are provably secure under the computational Diffie-Hellman assumption, in the standard …