Name
Affiliation
Papers
SHWETA AGRAWAL
University of Texas, Austin
44
Collaborators
Citations 
PageRank 
60
636
31.83
Referers 
Referees 
References 
990
420
560
Search Limit
100990
Title
Citations
PageRank
Year
Practical, Round-Optimal Lattice-Based Blind Signatures00.342022
Deniable Fully Homomorphic Encryption From Learning With Errors00.342021
Multi-Party Functional Encryption00.342021
Multi-Input Quadratic Functional Encryption From Pairings00.342021
Functional Encryption For Turing Machines With Dynamic Bounded Collusion From Lwe00.342021
Adaptive Simulation Security for Inner Product Functional Encryption.00.342020
Cryptography from One-Way Communication: On Completeness of Finite Channels.00.342020
A Practical Model for Collaborative Databases: Securely Mixing, Searching and Computing.00.342019
Ad Hoc Multi-Input Functional Encryption.00.342019
Attribute Based Encryption (and more) for Nondeterministic Finite Automata from LWE.00.342019
Attribute Based Encryption for Deterministic Finite Automata from mathsfDLIN.00.342019
Indistinguishability Obfuscation Without Multilinear Maps: New Methods for Bootstrapping and Instantiation10.342019
Attribute Based Encryption for Deterministic Finite Automata from DLIN.00.342019
New Methods for Indistinguishability Obfuscation: Bootstrapping and Instantiation.00.342018
Fe And Io For Turing Machines From Minimal Assumptions00.342018
Wiretap Polar Codes In Encryption Schemes Based On Learning With Errors Problem00.342018
Encryption with Untrusted Keys: Security against Chosen Objects Attack.00.342018
Functional Encryption for Bounded Collusions, Revisited.20.362017
Reusable Garbled Deterministic Finite Automata from Learning With Errors.00.342017
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks.50.392017
Efficient Public Trace and Revoke from Standard Assumptions: Extended Abstract.20.372017
Fully Secure Functional Encryption for Inner Products, from Standard Assumptions.260.892016
Interpolating Predicate and Functional Encryption from Learning With Errors.00.342016
Online-Offline Functional Encryption for Bounded Collusions.20.372016
Statistical Randomized Encodings: A Complexity Theoretic View40.372015
Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data.40.442015
Towards a Unified Theory of Cryptographic Agents.00.342014
Discrete Gaussian Leftover Hash Lemma over Infinite Domains110.882013
On Continual Leakage of Discrete Log Representations.180.622013
Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results.180.722013
Functional Encryption: New Perspectives and Lower Bounds.251.062012
Sampling Discrete Gaussians Efficiently and Obliviously.20.552012
Functional encryption for threshold functions (or fuzzy IBE) from lattices100.612012
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation.80.432012
Secrecy Using Compressive Sensing90.492011
Fuzzy Identity Based Encryption from Lattices.00.342011
Functional encryption for inner product predicates from learning with errors340.992011
Efficient lattice (H)IBE in the standard model1705.392010
Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE1333.992010
Preventing pollution attacks in multi-source network coding160.712010
On algebraic traceback in dynamic networks00.342009
Homomorphic MACs: MAC-Based Integrity for Network Coding1223.322009
On the secrecy rate of interference networks using structured codes100.962009
Construction of a coherency preserving dynamic data dissemination network40.482004