| Publication | Date of Publication | Type |
|---|
Compact proofs of partial knowledge for overlapping CNF formulae
Journal of Cryptology | 2024-12-27 | Paper |
Black-box (and fast) non-malleable zero knowledge
| 2024-12-13 | Paper |
Zero‐Knowledge Proofs
Asymmetric Cryptography | 2023-08-04 | Paper |
Efficient proofs of knowledge for threshold relations
Computer Security – ESORICS 2022 | 2023-07-28 | Paper |
Efficient NIZK arguments with straight-line simulation and extraction
Cryptology and Network Security | 2023-07-28 | Paper |
Doubly adaptive zero-knowledge proofs
Theoretical Computer Science | 2023-07-21 | Paper |
Black-box constructions of bounded-concurrent secure computation
| 2022-12-16 | Paper |
Shielded computations in smart contracts overcoming forks
| 2022-06-17 | Paper |
Publicly verifiable zero knowledge from (collapsing) blockchains
| 2021-12-21 | Paper |
How to extract useful randomness from unreliable sources
| 2021-12-01 | Paper |
Continuously non-malleable codes in the split-state model from minimal assumptions
| 2020-06-30 | Paper |
UC-secure multiparty computation from one-way functions using stateless tokens
| 2020-05-05 | Paper |
Universally composable secure computation with corrupted tokens
| 2020-03-09 | Paper |
Publicly verifiable proofs from blockchains
| 2020-01-28 | Paper |
Non-interactive zero knowledge \textit{proofs} in the random oracle model
| 2019-10-14 | Paper |
Non-interactive secure computation from one-way functions
| 2019-01-23 | Paper |
Round-optimal secure two-party computation from trapdoor permutations
| 2018-01-19 | Paper |
Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds
| 2018-01-19 | Paper |
Resettably-sound resettable zero knowledge in constant rounds
| 2018-01-19 | Paper |
Four-round concurrent non-malleable commitments from one-way functions
| 2017-11-15 | Paper |
Delayed-input cryptographic protocols
| 2017-08-04 | Paper |
Unconditional UC-secure computation with (stronger-malicious) PUFs
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Concurrent non-malleable commitments (and more) in 3 rounds
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Online/offline OR composition of sigma protocols
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
Theory of Cryptography | 2016-04-08 | Paper |
Improved OR-composition of sigma-protocols
Theory of Cryptography | 2016-04-08 | Paper |
Impossibility of black-box simulation against leakage attacks
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Executable proofs, input-size hiding secure computation and a new ideal world
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Black-box non-black-box zero knowledge
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On selective-opening attacks against encryption schemes
Lecture Notes in Computer Science | 2014-10-14 | Paper |
On Input Indistinguishable Proof Systems
Automata, Languages, and Programming | 2014-07-01 | Paper |
4-round resettably-sound zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
Statistical concurrent non-malleable zero knowledge
Theory of Cryptography | 2014-02-18 | Paper |
Constant-round concurrent zero knowledge in the bounded player model
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Nearly simultaneously resettable black-box zero knowledge
Automata, Languages, and Programming | 2013-08-12 | Paper |
Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
On constant-round concurrent non-malleable proof systems
Information Processing Letters | 2013-04-04 | Paper |
Concurrent zero knowledge in the bounded player model
Theory of Cryptography | 2013-03-18 | Paper |
Revisiting lower and upper bounds for selective decommitments
Theory of Cryptography | 2013-03-18 | Paper |
Secure database commitments and universal arguments of quasi knowledge
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Impossibility results for static input secure computation
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On round-optimal zero knowledge in the bare public-key model
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Simultaneously resettable arguments of knowledge
Theory of Cryptography | 2012-06-15 | Paper |
Resettable statistical zero knowledge
Theory of Cryptography | 2012-06-15 | Paper |
Secure set intersection with untrusted hardware tokens
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
Constant-round concurrent non-malleable statistically binding commitments and decommitments
Public Key Cryptography – PKC 2010 | 2010-05-28 | Paper |
Efficiency preserving transformations for concurrent non-malleable zero knowledge
Theory of Cryptography | 2010-02-24 | Paper |
Anonymous group communication in mobile networks (extended abstract)
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Collusion-Free Multiparty Computation in the Mediated Model
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Co-sound Zero-Knowledge with Public Keys
Progress in Cryptology – AFRICACRYPT 2009 | 2009-07-07 | Paper |
Hybrid commitments and their applications to zero-knowledge proof systems
Theoretical Computer Science | 2009-06-22 | Paper |
Simulation-Based Concurrent Non-malleable Commitments and Decommitments
Theory of Cryptography | 2009-03-03 | Paper |
Collusion-Free Protocols in the Mediated Model
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
Automata, Languages and Programming | 2008-08-19 | Paper |
Impossibility and Feasibility Results for Zero Knowledge with Public Keys
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Completely Non-malleable Encryption Revisited
Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings | 2008-03-05 | Paper |
Efficient Zero Knowledge on the Internet
Automata, Languages and Programming | 2007-09-11 | Paper |
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
Lecture Notes in Computer Science | 2007-09-05 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
| 2005-08-12 | Paper |
scientific article; zbMATH DE number 2043307 (Why is no real title available?)
| 2004-02-16 | Paper |
scientific article; zbMATH DE number 1952902 (Why is no real title available?)
| 2003-07-24 | Paper |
