( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security.

, , , и . ASIACRYPT, том 7073 из Lecture Notes in Computer Science, стр. 70-88. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Wolfgang Brett

Peter Brett

Reinhard Brett

Brett Schein

Brett Ridel

 

Другие публикации лиц с тем же именем

Reusable low-error compressive sampling schemes through privacy., , , , и . SSP, стр. 536-539. IEEE, (2012)Local List Recovery of High-rate Tensor Codes and Applications., , и . CoRR, (2017)Non-committing Encryption from Φ-hiding., , и . TCC (1), том 9014 из Lecture Notes in Computer Science, стр. 591-608. Springer, (2015)MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier., , и . Electron. Colloquium Comput. Complex., (2024)Recovering simple signals., , , , и . ITA, стр. 382-391. IEEE, (2012)DORAM Revisited: Maliciously Secure RAM-MPC with Logarithmic Overhead., , , , и . TCC (1), том 14369 из Lecture Notes in Computer Science, стр. 441-470. Springer, (2023)SoK: General Purpose Compilers for Secure Multi-Party Computation., , , и . IEEE Symposium on Security and Privacy, стр. 1220-1237. IEEE, (2019)Linear-Time List Recovery of High-Rate Expander Codes., и . ICALP (1), том 9134 из Lecture Notes in Computer Science, стр. 701-712. Springer, (2015)Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith's Method for Univariate Polynomials., , , и . ASIACRYPT (1), том 10031 из Lecture Notes in Computer Science, стр. 759-788. (2016)Local List Recovery of High-Rate Tensor Codes & Applications., , и . FOCS, стр. 204-215. IEEE Computer Society, (2017)