The following pages link to Sarah Meiklejohn (Q776011):
Displaying 14 items.
- Updatable and universal common reference strings with applications to zk-SNARKs (Q776013) (← links)
- Aggregatable distributed key generation (Q2056680) (← links)
- Quisquis: a new design for anonymous cryptocurrencies (Q2181901) (← links)
- SoK: algorithmic incentive manipulation attacks on permissionless PoW cryptocurrencies (Q2670873) (← links)
- Pay to win: cheap, cross-chain bribing attacks on PoW cryptocurrencies (Q2670874) (← links)
- Malleable Proof Systems and Applications (Q2894414) (← links)
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions (Q2953792) (← links)
- Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures (Q3058676) (← links)
- Succinct Malleable NIZKs and an Application to Compact Shuffles (Q4910273) (← links)
- Verifiable Elections That Scale for Free (Q4916026) (← links)
- Rethinking Verifiably Encrypted Signatures: A Gap in Functionality and Potential Solutions (Q5404761) (← links)
- Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig (Q5418713) (← links)
- Déjà Q: Using Dual Systems to Revisit q-Type Assumptions (Q5418719) (← links)
- Reaching consensus for asynchronous distributed key generation (Q6096032) (← links)