Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Guy N. Rothblum - MaRDI portal

Guy N. Rothblum

From MaRDI portal
Person:385708

Available identifiers

zbMath Open rothblum.guy-nMaRDI QIDQ385708

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q61263182024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61263362024-04-09Paper
Indistinguishable predictions and multi-group fair learning2024-01-16Paper
Verifying the unseen: interactive proofs for label-invariant distribution properties2023-12-08Paper
Outcome indistinguishability2023-11-14Paper
On Prover-Efficient Public-Coin Emulation of Interactive Proofs2023-07-03Paper
https://portal.mardi4nfdi.de/entity/Q58757102023-02-03Paper
Worst-Case to Average-Case Reductions for Subclasses of P2022-08-30Paper
Constant-Round Interactive Proof Systems for AC0[2 and NC1]2022-08-30Paper
Batch verification and proofs of proximity with polylog overhead2022-03-23Paper
Batch verification for statistical zero knowledge proofs2022-03-23Paper
Constant-Round Interactive Proofs for Delegating Computation2021-06-29Paper
https://portal.mardi4nfdi.de/entity/Q49932812021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q51219102020-09-22Paper
Incrementally verifiable computation via incremental PCPs2020-04-30Paper
Gentle measurement of quantum states and differential privacy2020-01-30Paper
Fiat-Shamir: from practice to theory2020-01-30Paper
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir2020-01-30Paper
Fine-grained Complexity Meets IP = PSPACE2019-10-15Paper
Composable and versatile privacy via truncated CDP2019-08-22Paper
https://portal.mardi4nfdi.de/entity/Q57433872019-05-10Paper
Delegating Computation2018-08-02Paper
On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments2018-01-19Paper
From obfuscation to the security of Fiat-Shamir for proofs2017-11-15Paper
Constant-round interactive proofs for delegating computation2017-09-29Paper
Black-box obfuscation for d-CNFs2017-05-19Paper
Obfuscating conjunctions2017-03-02Paper
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems2016-11-09Paper
Pure Differential Privacy for Rectangle Queries via Private Partitions2016-03-23Paper
The complexity of online memory checking2015-11-11Paper
How to Compute in the Presence of Leakage2015-11-04Paper
On the complexity of differentially private data release2015-02-04Paper
On best-possible obfuscation2014-09-25Paper
Differential privacy under continual observation2014-08-13Paper
Interactive proofs of proximity2014-08-07Paper
Fast Pseudorandomness for Independence and Load Balancing2014-07-01Paper
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding2014-02-18Paper
Refereed delegation of computation2013-12-03Paper
Obfuscating Conjunctions2013-09-17Paper
Two Protocols for Delegation of Computation2012-11-06Paper
How to Compute under $${\mathcal {\varvec{AC}}}^\mathbf{0}$$ Leakage without Secure Hardware2012-09-25Paper
Securely obfuscating re-encryption2012-01-13Paper
Program Obfuscation with Leaky Hardware2011-12-02Paper
Are PCPs inherent in efficient arguments?2011-02-18Paper
Securing Computation against Continuous Leakage2010-08-24Paper
Obfuscation of Hyperplane Membership2010-02-24Paper
Leakage-Resilient Signatures2010-02-24Paper
Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles2009-08-06Paper
How Efficient Can Memory Checking Be?2009-03-03Paper
Weak Verifiable Random Functions2009-03-03Paper
One-Time Programs2009-02-10Paper
https://portal.mardi4nfdi.de/entity/Q35496432009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35496912009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35496942009-01-05Paper
The Complexity of Local List Decoding2008-11-27Paper
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles2007-11-15Paper
On Best-Possible Obfuscation2007-08-30Paper
Securely Obfuscating Re-encryption2007-08-30Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Guy N. Rothblum