73 results on '"Siniscalchi, Luisa"'
Search Results
2. Black-Box (and Fast) Non-malleable Zero Knowledge
3. Heuristics for constrained role mining in the post-processing framework
4. Broadcast-Optimal Four-Round MPC in the Plain Model
5. Broadcast-Optimal Two Round MPC with Asynchronous Peer-to-Peer Channels
6. List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
7. Minimizing Setup in Broadcast-Optimal Two Round MPC
8. Broadcast-Optimal Four-Round MPC in the Plain Model
9. Minimizing Setup in Broadcast-Optimal Two Round MPC
10. List Oblivious Transfer and Applications to Round-Optimal Black-Box Multiparty Coin Tossing
11. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
12. On Sufficient Oracles for Secure Computation with Identifiable Abort
13. Round-Optimal Multi-party Computation with Identifiable Abort
14. Broadcast-Optimal Two Round MPC with an Honest Majority
15. Balancing Privacy and Accountability in Blockchain Identity Management
16. Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains
17. Multi-Client Functional Encryption for Separable Functions
18. Four-Round Black-Box Non-malleable Schemes from One-Way Permutations
19. Round-Optimal Multi-party Computation with Identifiable Abort
20. How to Extract Useful Randomness from Unreliable Sources
21. Publicly Verifiable Proofs from Blockchains
22. Multi-Client Functional Encryption for Separable Functions
23. Balancing Privacy and Accountability in Blockchain Identity Management
24. Broadcast-Optimal Two Round MPC with an Honest Majority
25. Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains
26. Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
27. PostProcessing in Constrained Role Mining
28. How to Extract Useful Randomness from Unreliable Sources
29. Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
30. Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
31. Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
32. Concurrent Non-Malleable Commitments (and More) in 3 Rounds
33. Online/Offline OR Composition of Sigma Protocols
34. Improved OR-Composition of Sigma-Protocols
35. A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
36. Publicly Verifiable Proofs from Blockchains
37. PostProcessing in Constrained Role Mining
38. Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
39. Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors
40. Four-Round Concurrent Non-Malleable Commitments from One-Way Functions
41. Round-Optimal Secure Two-Party Computation from Trapdoor Permutations
42. Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds
43. Multiparty Computation with Covert Security and Public Verifiability
44. Heuristics for constrained role mining in the post-processing framework
45. Concurrent Non-Malleable Commitments (and More) in 3 Rounds
46. Online/Offline OR Composition of Sigma Protocols
47. Improved OR-Composition of Sigma-Protocols
48. A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
49. Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints.
50. Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.