We use the signal function from RLWE key exchange to derive an efficient zero knowledge authentication protocol to validate an RLWE key p=as+e with secret s and error e in the Random Oracle Model (ROM). With this protocol, a verifier can validate that a key presented to him by a prover P is of the form p=as+e with s,e small and that the prover knows s. We accompany the description of the protocol with proof to show that it has negligible soundness and completeness error. The soundness of our protocol relies directly on the hardness of the RLWE problem. The protocol is applicable for both LWE and RLWE but we focus on the RLWE based protocol for efficiency and practicality. We also present a variant of the main protocol with a commitment scheme to avoid using the ROM.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

In this paper, we characterize, for 1≤$p$<∞, the multiple ($p$, 1)-summing multilinear operators on the product of$C(K)$spaces in terms of their representing polymeasures. As consequences, we obtain a new characterization of ($p$, 1)-summing linear operators on$C(K)$in terms of their representing measures and a new multilinear characterization of$L$_{∞}spaces. We also solve a problem stated by M.S. Ramanujan and E. Schock, improve a result of H. P. Rosenthal and S. J. Szarek, and give new results about polymeasures.