( en | de | ru )

 

Disambiguation of "Agrawal, Shweta"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient Public Trace and Revoke from Standard Assumptions.

, , , , and . IACR Cryptology ePrint Archive, (2017)

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.

Shweta Pahujani

Deepashri Agrawal

Shweta Tiwari

Shweta Aggarwal

Mukesh Agrawal

 

Other publications of authors with the same name

Multi-input Quadratic Functional Encryption from Pairings., , and . CRYPTO (4), volume 12828 of Lecture Notes in Computer Science, page 208-238. Springer, (2021)Deniable Fully Homomorphic Encryption from Learning with Errors., , and . CRYPTO (2), volume 12826 of Lecture Notes in Computer Science, page 641-670. Springer, (2021)Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013., , , , , and . Des. Codes Cryptogr., 90 (10): 2301-2318 (2022)Functional Encryption for Bounded Collusions, Revisited., and . TCC (1), volume 10677 of Lecture Notes in Computer Science, page 173-205. Springer, (2017)Indistinguishability Obfuscation Without Maps: Attacks and Fixes for Noisy Linear FE., and . EUROCRYPT (1), volume 12105 of Lecture Notes in Computer Science, page 110-140. Springer, (2020)Practical, Round-Optimal Lattice-Based Blind Signatures., , , and . CCS, page 39-53. ACM, (2022)On algebraic traceback in dynamic networks., , and . ISIT, page 1903-1907. IEEE, (2010)Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation.. EUROCRYPT (1), volume 11476 of Lecture Notes in Computer Science, page 191-225. Springer, (2019)Efficient Lattice (H)IBE in the Standard Model., , and . EUROCRYPT, volume 6110 of Lecture Notes in Computer Science, page 553-572. Springer, (2010)Attribute Based Encryption for Deterministic Finite Automata from \mathsfDLIN., , and . TCC (2), volume 11892 of Lecture Notes in Computer Science, page 91-117. Springer, (2019)