HElib homomorphic encryption library

Target entity: HElib homomorphic encryption library
Context triple: [Victor Shoup, knownFor, HElib homomorphic encryption library]

• A. Hybrid Public Key Encryption (HPKE)
  Hybrid Public Key Encryption (HPKE) is a cryptographic framework that combines public-key and symmetric-key techniques to provide flexible, interoperable encryption for modern protocols such as TLS, QUIC, and MLS.
• B. Rabin cryptosystem
  The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
• C. SIV misuse-resistant AEAD
  SIV misuse-resistant AEAD is a cryptographic scheme designed to provide authenticated encryption that remains secure even when nonces are misused or repeated.
• D. Yao’s garbled circuits
  Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
• E. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: HElib homomorphic encryption library
Target entity description: HElib is an open-source C++ library that implements advanced homomorphic encryption schemes, enabling computation on encrypted data without decryption.

• A. Hybrid Public Key Encryption (HPKE)
  Hybrid Public Key Encryption (HPKE) is a cryptographic framework that combines public-key and symmetric-key techniques to provide flexible, interoperable encryption for modern protocols such as TLS, QUIC, and MLS.
• B. Rabin cryptosystem
  The Rabin cryptosystem is a public-key encryption scheme based on the hardness of integer factorization, notable for its provable security equivalence to factoring and its similarity to RSA.
• C. SIV misuse-resistant AEAD
  SIV misuse-resistant AEAD is a cryptographic scheme designed to provide authenticated encryption that remains secure even when nonces are misused or repeated.
• D. Yao’s garbled circuits
  Yao’s garbled circuits is a foundational cryptographic protocol that enables secure two-party computation by allowing parties to jointly compute a function over their private inputs without revealing those inputs to each other.
• E. Blum–Blum–Shub pseudorandom number generator
  The Blum–Blum–Shub pseudorandom number generator is a cryptographically secure generator based on the hardness of factoring large composite numbers, widely studied in theoretical computer science and cryptography.
• F. None of above. chosen