Riad S. Wahby

Riad S. Wahby

Auto-generated profile, based on publicly available information

Riad S. Wahby

Carnegie Mellon University, Pittsburgh, PA, USA

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 November 2023
Verified
Conference Paper
Open access
NTNirvan Tyagi
Nirvan Tyagi
AAArasu Arun
Arasu Arun
CFCody Freitag
Cody Freitag
RWRiad Wahby
Riad Wahby
JBJoseph Bonneau
Joseph Bonneau
DMDavid Mazières
David Mazières
We introduce the first practical protocols for fully decentralized sealed-bid auctions using timed commitments. Timed commitments ensure that the auction is finalized fairly even if all participants drop out after posting bids or if n bidders collude to try to learn the nth bidder's bid value. Our protocols rely on a novel non-malleable timed commitment scheme which efficiently supports range proofs to establish that bidders have sufficient funds to cover a hidden bid value. This allows us to penalize users who abandon bids for exactly the bid value, while supporting simultaneous bidding in multiple auctions with a shared collateral pool. Our protocols are concretely efficient and we have implemented them in an Ethereum-compatible smart contract which automatically enforces payment and delivery of an auctioned digital asset.

15 November 2004
Verified
Conference Paper
Open access
JRJ.M. Rivas
J.M. Rivas
RWR.S. Wahby
R.S. Wahby
JSJ.S. Shafran
J.S. Shafran
DPD.J. Perreault
D.J. Perreault

31 December 2024 in ACM Transactions on Programming Languages and Systems
Verified
Journal Article
Open access
MPMarco Patrignani
Marco Patrignani
RKRobert Künnemann
Robert Künnemann
RWRiad S. Wahby
Riad S. Wahby
ECEthan Cecchetti
Ethan Cecchetti
This article discusses the relationship between two frameworks: universal composability ( \(\mathsf{UC}\) ) and robust compilation ( RC ). In cryptography, \(\mathsf{UC}\) is a framework for the specification and analysis of cryptographic protocols with a strong compositionality guarantee: \(\mathsf{UC}\) protocols remain secure even when composed with other protocols. In programming language security, RC is a novel framework for determining secure compilation by proving whether compiled programs are as secure as their source-level counterparts no matter what target-level code they interact with. Presently, these disciplines are studied in isolation, though we argue that there is a deep connection between them and exploring this connection will benefit both research fields. This article formally proves the connection between \(\mathsf{UC}\) and RC and then it explores the benefits of this connection (focussing on perfect, rather than computational \(\mathsf{UC}\) ). For this, this article first identifies which conditions must programming languages fulfil in order to possibly attain \(\mathsf{UC}\) -like composition. Then, it proves \(\mathsf{UC}\) of both an existing and a new commitment protocol as a corollary of the related compilers attaining RC . Finally, it mechanises these proofs in DEEPSEC, obtaining symbolic guarantees that the protocol is indeed \(\mathsf{UC}\) . Our connection lays the groundwork towards a better and deeper understanding of both \(\mathsf{UC}\) and RC , and the benefits we showcase from this connection provide evidence of scalable mechanised proofs for \(\mathsf{UC}\) .