Riad S. Wahby

According to our database1, Riad S. Wahby authored at least 34 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Bending microarchitectural weird machines towards practicality.
Proceedings of the 33rd USENIX Security Symposium, 2024

2023
Hashing to Elliptic Curves.
RFC, August, 2023

Specialized Proof of Confidential Knowledge (SPoCK).
IACR Cryptol. ePrint Arch., 2023

Unlocking the lookup singularity with Lasso.
IACR Cryptol. ePrint Arch., 2023

Customizable constraint systems for succinct arguments.
IACR Cryptol. ePrint Arch., 2023

Bounded Verification for Finite-Field-Blasting (In a Compiler for Zero Knowledge Proofs).
IACR Cryptol. ePrint Arch., 2023

Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols.
IACR Cryptol. ePrint Arch., 2023

Checking Passwords on Leaky Computers: A Side Channel Analysis of Chrome's Password Leak Detect Protocol.
Proceedings of the 32nd USENIX Security Symposium, 2023

The ghost is the machine: Weird machines in transient execution.
Proceedings of the 2023 IEEE Security and Privacy Workshops (SPW), 2023

Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
CirC: Compiler infrastructure for proof systems, software verification, and more.
Proceedings of the 43rd IEEE Symposium on Security and Privacy, 2022

2021
Concretely efficient interactive proofs and their applications.
PhD thesis, 2021

Linear-time zero-knowledge SNARKs for R1CS.
IACR Cryptol. ePrint Arch., 2021

Brakedown: Linear-time and post-quantum SNARKs for R1CS.
IACR Cryptol. ePrint Arch., 2021

2020
An airdrop that preserves recipient privacy.
IACR Cryptol. ePrint Arch., 2020

Unifying Compilers for SNARKs, SMT, and More.
IACR Cryptol. ePrint Arch., 2020

Compact Certificates of Collective Knowledge.
IACR Cryptol. ePrint Arch., 2020

Scaling Verifiable Computation Using Efficient Set Accumulators.
Proceedings of the 29th USENIX Security Symposium, 2020

2019
Fast and simple constant-time hashing to the BLS12-381 elliptic curve.
IACR Trans. Cryptogr. Hardw. Embed. Syst., 2019

Scaling Verifiable Computation Using Efficient Set Accumulators.
IACR Cryptol. ePrint Arch., 2019

Universal Composability is Secure Compilation.
CoRR, 2019

FaCT: a DSL for timing-sensitive computation.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Pantheon: the training ground for Internet congestion-control research.
Proceedings of the 2018 USENIX Annual Technical Conference, 2018

Salsify: Low-Latency Network Video through Tighter Integration between a Video Codec and a Transport Protocol.
Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation, 2018

2017
Doubly-efficient zkSNARKs without trusted setup.
IACR Cryptol. ePrint Arch., 2017

Full accounting for verifiable outsourcing.
IACR Cryptol. ePrint Arch., 2017

Finding and Preventing Bugs in JavaScript Bindings.
Proceedings of the 2017 IEEE Symposium on Security and Privacy, 2017

Encoding, Fast and Slow: Low-Latency Video Processing Using Thousands of Tiny Threads.
Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation, 2017

Trust but Verify: Auditing the Secure Internet of Things.
Proceedings of the 15th Annual International Conference on Mobile Systems, 2017

2016
Robust, low-cost, auditable random number generation for embedded system security.
IACR Cryptol. ePrint Arch., 2016

Defending against Malicious Peripherals with Cinch.
Proceedings of the 25th USENIX Security Symposium, 2016

2015
Verifiable ASICs.
IACR Cryptol. ePrint Arch., 2015

Harmful devices considered harmless.
CoRR, 2015

2014
Efficient RAM and control flow in verifiable outsourced computation.
IACR Cryptol. ePrint Arch., 2014


  Loading...