Melissa Chase

ORCID: 0009-0003-8333-3942
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptography and Data Security
  • Privacy-Preserving Technologies in Data
  • Complexity and Algorithms in Graphs
  • Internet Traffic Analysis and Secure E-voting
  • Cryptographic Implementations and Security
  • Blockchain Technology Applications and Security
  • Chaos-based Image/Signal Encryption
  • Geometric and Algebraic Topology
  • AI-based Problem Solving and Planning
  • Coding theory and cryptography
  • Software Engineering Research
  • Cardiac Valve Diseases and Treatments
  • Adversarial Robustness in Machine Learning
  • Security and Verification in Computing
  • Software System Performance and Reliability
  • Security in Wireless Sensor Networks
  • Advanced Software Engineering Methodologies
  • Advanced Authentication Protocols Security
  • Distributed systems and fault tolerance
  • DNA and Biological Computing
  • Physical Unclonable Functions (PUFs) and Hardware Security
  • User Authentication and Security Systems
  • Cryptography and Residue Arithmetic
  • Cardiac pacing and defibrillation studies
  • Spam and Phishing Detection

Microsoft (United States)
2015-2024

Microsoft Research (United Kingdom)
2009-2024

Virginia Tech
2022

Stanford University
2020

Ecological Society of America
2018

John Wiley & Sons (United States)
2018

University of Colorado Denver
2016-2017

Rose Medical Center
2016-2017

Brown University
2006-2008

John Brown University
2005-2008

Attribute based encryption (ABE) [13] determines decryption ability on a user's attributes. In multi-authority ABE scheme, multiple attribute-authorities monitor different sets of attributes and issue corresponding keys to users, encryptors can require that user obtain for appropriate from each authority before decrypting message. Chase [5] gave scheme using the concepts trusted central (CA) global identifiers (GID). However, CA in construction has power decrypt every ciphertext, which seems...

10.1145/1653662.1653678 article EN 2009-11-09

We explore the challenge of preserving patients' privacy in electronic health record systems. argue that security such systems should be enforced via encryption as well access control. Furthermore, we for approaches enable patients to generate and store keys, so is protected host data center compromised. The standard argument against an approach would interfere with functionality system. However, show can build efficient system allows both share partial rights others, perform searches over...

10.1145/1655008.1655024 article EN 2009-11-13

We propose a new class of post-quantum digital signature schemes that: (a) derive their security entirely from the symmetric-key primitives, believed to be quantum-secure, and (b) have extremely small keypairs, and, (c) are highly parameterizable.

10.1145/3133956.3133997 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2017-10-27

Time and again, attribute-based encryption has been shown to be the natural cryptographic tool for building various types of conditional access systems with far-reaching applications, but deployment such very slow. A central issue is lack an scheme that can operate on sensitive data efficiently and, at same time, provides features are important in practice.

10.1145/3133956.3134014 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2017-10-27

Property inference attacks consider an adversary who has access to a trained ML model and tries extract some global statistics of the training data. In this work, we study property in scenarios where can maliciously control part data (poisoning data) with goal increasing leakage. Previous works on poisoning focused trying decrease accuracy models. Here, for first time, is increase information leakage model. We show that boost significantly should be considered as stronger threat sensitive...

10.1109/sp46214.2022.9833623 article EN 2022 IEEE Symposium on Security and Privacy (SP) 2022-05-01

We describe different strategies a central authority, the boss, can use to distribute computation untrusted contractors. Our problem is inspired by volunteer distributed computing projects such as [email protected], which outsource large numbers of participants. For many tasks, verifying task's output requires much work it again; additionally, some tasks may produce certain outputs with greater probability than others. A selfish contractor try exploit these factors, submitting potentially...

10.1145/1403027.1403046 article EN 2008-08-22

We consider the problem of constructing anonymous credentials for use in a setting where issuer is also verifier, or more generally and verifier have shared key. In this we can message authentication codes (MACs) instead public key signatures as basis credential system.

10.1145/2660267.2660328 article EN Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security 2014-11-03

Abstract In this paper, we consider a setting where client wants to outsource storage of large amount private data and then perform substring search queries on the – given string s p , find all occurrences as . First, formalize an encryption paradigm that call queryable which generalizes searchable symmetric (SSE) structured encryption. Then, construct scheme for queries. Our construction uses suffix trees achieves asymptotic efficiency comparable unencrypted trees. Encryption length n takes...

10.1515/popets-2015-0014 article EN cc-by-nc-nd Proceedings on Privacy Enhancing Technologies 2015-06-01

Peer-to-peer systems have been proposed for a wide variety of applications, including file-sharing, web caching, distributed computation, cooperative backup, and onion routing. An important motivation such is self-scaling. That is, increased participation increases the capacity system. Unfortunately, this property at risk from selfish participants. The decentralized nature peer-to-peer makes accounting difficult. We show that e-cash can be practical solution to desire accountability in while...

10.1145/1314333.1314339 article EN 2007-10-29
Coming Soon ...