The following pages link to Luisa Siniscalchi (Q826290):
Displayed 20 items.
- Balancing privacy and accountability in blockchain identity management (Q826291) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Four-round concurrent non-malleable commitments from one-way functions (Q1678367) (← links)
- Round-optimal secure two-party computation from trapdoor permutations (Q1690212) (← links)
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds (Q1690213) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Round-optimal multi-party computation with identifiable abort (Q2170005) (← links)
- Publicly verifiable proofs from blockchains (Q2289215) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors (Q5097003) (← links)
- Online/Offline OR Composition of Sigma Protocols (Q5739198) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- On sufficient oracles for secure computation with identifiable abort (Q6134836) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)