( en | de | ru )

 

Disambiguation of "Farshim, Pooya"

Author of the publication

copydeleteadd this publication to your clipboard
Polly Cracker, Revisited.

, , , , and . Electron. Colloquium Comput. Complex., (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Alexander Farshim

Pooya Salehi

Ladan Pooyan-Weihs

 

Other publications of authors with the same name

Random-Oracle Uninstantiability from Indistinguishability Obfuscation., , and . TCC (2), volume 9015 of Lecture Notes in Computer Science, page 428-455. Springer, (2015)Secure Cryptographic Workflow in the Standard Model., and . INDOCRYPT, volume 4329 of Lecture Notes in Computer Science, page 379-393. Springer, (2006)Robust Encryption, Revisited., , , and . Public Key Cryptography, volume 7778 of Lecture Notes in Computer Science, page 352-368. Springer, (2013)Certified Encryption Revisited., and . AFRICACRYPT, volume 5580 of Lecture Notes in Computer Science, page 179-197. Springer, (2009)Polly Cracker, Revisited., , , and . ASIACRYPT, volume 7073 of Lecture Notes in Computer Science, page 179-196. Springer, (2011)The Related-Key Security of Iterated Even-Mansour Ciphers., and . FSE, volume 9054 of Lecture Notes in Computer Science, page 342-363. Springer, (2015)Beyond Uber: Instantiating Generic Groups via PGGs., , , and . TCC (3), volume 13749 of Lecture Notes in Computer Science, page 212-242. Springer, (2022)Certificateless signcryption., and . AsiaCCS, page 369-372. ACM, (2008)Strong Knowledge Extractors for Public-Key Encryption Schemes., and . ACISP, volume 6168 of Lecture Notes in Computer Science, page 164-181. Springer, (2010)Relations among Notions of Complete Non-malleability: Indistinguishability Characterisation and Efficient Construction without Random Oracles., and . ACISP, volume 6168 of Lecture Notes in Computer Science, page 145-163. Springer, (2010)