The following pages link to Ivan Visconti (Q776001):
Displaying 50 items.
- Continuously non-malleable codes in the split-state model from minimal assumptions (Q776002) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← 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)
- Resettably-sound resettable zero knowledge in constant rounds (Q1690264) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- Delayed-input cryptographic protocols (Q2011641) (← links)
- How to extract useful randomness from unreliable sources (Q2055615) (← links)
- Publicly verifiable zero knowledge from (collapsing) blockchains (Q2061968) (← links)
- Black-box constructions of bounded-concurrent secure computation (Q2106632) (← links)
- Shielded computations in smart contracts overcoming forks (Q2145367) (← links)
- UC-secure multiparty computation from one-way functions using stateless tokens (Q2176666) (← links)
- Publicly verifiable proofs from blockchains (Q2289215) (← links)
- Universally composable secure computation with corrupted tokens (Q2304927) (← links)
- Non-interactive zero knowledge \textit{proofs} in the random oracle model (Q2327180) (← 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)
- Nearly Simultaneously Resettable Black-Box Zero Knowledge (Q2843238) (← links)
- Constant-Round Concurrent Zero Knowledge in the Bounded Player Model (Q2867209) (← links)
- Resettable Statistical Zero Knowledge (Q2891502) (← links)
- Simultaneously Resettable Arguments of Knowledge (Q2891504) (← links)
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model (Q2894406) (← links)
- Secure Database Commitments and Universal Arguments of Quasi Knowledge (Q2914263) (← links)
- Impossibility Results for Static Input Secure Computation (Q2914274) (← links)
- On Selective-Opening Attacks against Encryption Schemes (Q2922682) (← links)
- Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World (Q2948395) (← links)
- Secure Set Intersection with Untrusted Hardware Tokens (Q3073691) (← links)
- Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- Impossibility of Black-Box Simulation Against Leakage Attacks (Q3457063) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments (Q3562896) (← links)
- Efficient Zero Knowledge on the Internet (Q3591408) (← links)
- Collusion-Free Protocols in the Mediated Model (Q3600237) (← links)
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments (Q3611761) (← links)
- Co-sound Zero-Knowledge with Public Keys (Q3637146) (← links)
- (Q4414283) (← links)
- (Q4450730) (← links)
- Concurrent Zero Knowledge in the Bounded Player Model (Q4910271) (← links)
- Revisiting Lower and Upper Bounds for Selective Decommitments (Q4910298) (← links)
- Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions (Q4924440) (← links)
- On Input Indistinguishable Proof Systems (Q5167801) (← links)
- Black-box non-black-box zero knowledge (Q5259587) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311536) (← links)
- Completely Non-malleable Encryption Revisited (Q5445447) (← links)
- Impossibility and Feasibility Results for Zero Knowledge with Public Keys (Q5451023) (← links)
- Improved Setup Assumptions for 3-Round Resettable Zero Knowledge (Q5465836) (← links)
