Titlebook: Security and Cryptography for Networks; 11th International C Dario Catalano,Roberto De Prisco Conference proceedings 2018 Springer Nature S

Perceive

A Constructive Perspective on Signcryption Securityon without the need of prior key agreement. Instead, a party registers its public key at a certificate authority (CA), and only needs to retrieve the public key of the intended partner from the CA before being able to protect the communication. Signcryption schemes provide both authenticity and conf

CLAM

Tight Adaptively Secure Broadcast Encryption with Short Ciphertexts and Keysresult improves upon the work of Boneh, Gentry and Waters (Crypto ’05) as well as several recent follow-ups (TCC ’16-A, Asiacrypt ’16) in two ways: (i) we achieve adaptive security instead of selective security, and (ii) our construction relies on the decisional .-Linear Assumption in prime-order gr

Peculate

BATE

Lizard: Cut Off the Tail! A Practical Post-quantum Public-Key Encryption from LWE and LWRlems and the lightweight operations for generating its instances. The PKE schemes based on the LWE problem have a simple and fast decryption, but the encryption phase requires large parameter size for the leftover hash lemma or Gaussian samplings..In this paper, we propose a novel PKE scheme, called

thyroid-hormone

Homocystinuria

Proactive Secure Multiparty Computation with a Dishonest Majoritytiality of inputs (and outputs, if desired) and correctness of the computation, as long as no adversary corrupts more than a threshold . of the . parties. Existing MPC protocols assure perfect security for . active corruptions with termination (i.e., robustness), or up to . under cryptographic assum

CAB

Acupressure

Efficient Scalable Multiparty Private Set-Intersection via Garbled Bloom Filtersthat guarantees both correctness and privacy. This secure computation task is of great importance and usability in many different real-life scenarios. Much research was dedicated to the construction of PSI-tailored concretely efficient protocols for the case of two-party PSI. The case of many partie

Oversee

Semantically Secure Anonymity: Foundations of Re-encryptionertext without changing its size, without first decrypting it, and without knowing who the receiver is (i.e., not knowing the public key used to create it). By design it prevents the randomized ciphertext from being correlated with the original ciphertext. We revisit and analyze the security foundat

平

Unforgeable Watermarking Schemes with Public Extractionprogram, one must communicate with a third party. This greatly limits the applicability of current watermarking schemes. In this paper, we solve this problem by presenting the first (stateless) publicly extractable watermarking scheme with unremovability and unforgeability.