The following pages link to Rafael Dowsley (Q1715858):
Displaying 22 items.
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- 21 -- bringing down the complexity: fast composable protocols for card games without secret state (Q1784436) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Efficient UC commitment extension with homomorphism for free (and applications) (Q2176667) (← links)
- Insured MPC: efficient secure computation with financial penalties (Q2226602) (← links)
- Standard Security Does Not Imply Security against Selective-Opening (Q2894436) (← links)
- How Secure is Deterministic Encryption? (Q2941186) (← links)
- Digital Signatures from Strong RSA without Prime Generation (Q2941193) (← links)
- Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens (Q2947531) (← links)
- A CCA2 Secure Variant of the McEliece Cryptosystem (Q2989758) (← links)
- Efficient Unconditionally Secure Comparison and Privacy Preserving Machine Learning Classification Protocols (Q3464410) (← links)
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model (Q3623048) (← links)
- On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability (Q4566529) (← links)
- Commitment and Oblivious Transfer in the Bounded Storage Model With Errors (Q4682890) (← links)
- On the Commitment Capacity of Unfair Noisy Channels (Q5124396) (← links)
- Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model (Q5273509) (← links)
- Universally Composable Oblivious Transfer Based on a Variant of LPN (Q5498721) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- On the Impossibility of Structure-Preserving Deterministic Primitives (Q5746360) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- Post-quantum verifiable random function from symmetric primitives in PoS blockchain (Q6173282) (← links)