The following pages link to Dominique Schröder (Q1703918):
Displaying 43 items.
- Efficient ring signatures in the standard model (Q1703919) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Arithmetic garbling from bilinear maps (Q2167776) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Efficient invisible and unlinkable sanitizable signatures (Q2289208) (← links)
- Security of blind signatures revisited (Q2397446) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- Foundations of Reconfigurable PUFs (Q2794518) (← links)
- Efficient Unlinkable Sanitizable Signatures from Signatures with Re-randomizable Keys (Q2798781) (← links)
- Delegatable Functional Signatures (Q2798783) (← links)
- Nearly Optimal Verifiable Data Streaming (Q2798786) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- Feasibility and Infeasibility of Secure Computation with Malicious PUFs (Q2874550) (← links)
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations (Q2891510) (← links)
- Security of Blind Signatures Revisited (Q2900251) (← links)
- History-Free Sequential Aggregate Signatures (Q2912789) (← links)
- On Tight Security Proofs for Schnorr Signatures (Q2938862) (← links)
- Impossibility of Blind Signatures from One-Way Permutations (Q3000567) (← links)
- Expedient Non-malleability Notions for Hash Functions (Q3073712) (← links)
- Security of blind signatures under aborts and applications to adaptive oblivious transfer (Q3096954) (← links)
- How to Aggregate the CL Signature Scheme (Q3100900) (← links)
- Security of Verifiably Encrypted Signatures and a Construction without Random Oracles (Q3392898) (← links)
- Efficient Pseudorandom Functions via On-the-Fly Adaptation (Q3457117) (← links)
- Fair Partially Blind Signatures (Q3558302) (← links)
- Public-Key Encryption with Non-Interactive Opening: New Constructions and Stronger Definitions (Q3558321) (← links)
- Unlinkability of Sanitizable Signatures (Q3562914) (← links)
- Confidential Signatures and Deterministic Signcryption (Q3562915) (← links)
- On the Impossibility of Three-Move Blind Signature Schemes (Q3563836) (← links)
- Generic Constructions for Verifiably Encrypted Signatures without Random Oracles or NIZKs (Q3575037) (← links)
- Redactable Signatures for Tree-Structured Data: Definitions and Constructions (Q3575039) (← links)
- History-Free Aggregate Message Authentication Codes (Q3588350) (← links)
- Security of Sanitizable Signatures Revisited (Q3615623) (← links)
- Security of Blind Signatures under Aborts (Q3617527) (← links)
- Verifiably Encrypted Signatures: Security Revisited and a New Construction (Q5097044) (← links)
- WebTrust – A Comprehensive Authenticity and Integrity Framework for HTTP (Q5168558) (← links)
- Round Optimal Blind Signatures (Q5199217) (← links)
- (Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens (Q5746357) (← links)
- Inner product functional commitments with constant-size public parameters and openings (Q6134851) (← links)
- Maliciously Secure Multi-Client ORAM (Q6487223) (← links)
- Foundations of adaptor signatures (Q6636503) (← links)
- SoK: Descriptive Statistics Under Local Differential Privacy -- Raw Results (Q6717520) (← links)
