Bailey Kacsmar

Orcid: 0000-0002-7229-6504

According to our database1, Bailey Kacsmar authored at least 11 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
4
1
1
1
1
2
1
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
PEPSI: Practically Efficient Private Set Intersection in the Unbalanced Setting.
Proceedings of the 33rd USENIX Security Symposium, 2024

Fast and Private Inference of Deep Neural Networks by Co-designing Activation Functions.
Proceedings of the 33rd USENIX Security Symposium, 2024

2023
Comprehension from Chaos: Towards Informed Consent for Private Computation.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Comprehension from Chaos: What Users Understand and Expect from Private Computation.
CoRR, 2022

Caring about Sharing: User Perceptions of Multiparty Data Sharing.
Proceedings of the 31st USENIX Security Symposium, 2022

Improving Interactive Instruction: Faculty Engagement Requires Starting Small and Telling All.
Proceedings of the Koli Calling '22: 22nd Koli Calling International Conference on Computing Education Research, 2022

2020
Mind the Gap: Ceremonies for Applied Secret Sharing.
Proc. Priv. Enhancing Technol., 2020

Differentially Private Two-Party Set Operations.
Proceedings of the IEEE European Symposium on Security and Privacy, 2020

Practical Over-Threshold Multi-Party Private Set Intersection.
Proceedings of the ACSAC '20: Annual Computer Security Applications Conference, 2020

2019
A network reliability approach to the analysis of combinatorial repairable threshold schemes.
Adv. Math. Commun., 2019

2017
Computing Low-Weight Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2017


  Loading...