The following pages link to Giuseppe Persiano (Q294655):
Displaying 50 items.
- The graph clustering problem has a perfect zero-knowledge interactive proof (Q294656) (← links)
- Convergence to equilibrium of logit dynamics for strategic games (Q334931) (← links)
- Mixing time and stationary expected social welfare of logit dynamics (Q372983) (← links)
- Innovative approaches for security of small artefacts (Q465672) (← links)
- Dynamic and static algorithms for optimal placement of resources in a tree (Q671529) (← links)
- Minimal path length of trees with known fringe (Q673649) (← links)
- Characteristic inequalities for binary trees (Q674183) (← links)
- Continuously non-malleable codes in the split-state model from minimal assumptions (Q776002) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- The power of verification for one-parameter agents (Q1004286) (← links)
- Round-optimal perfect zero-knowledge proofs (Q1322120) (← links)
- The knowledge complexity of quadratic residuosity languages (Q1334668) (← links)
- A note on the expected path length of trees with known fringe (Q1350914) (← links)
- Metastability of logit dynamics for coordination games (Q1755731) (← links)
- Zero-knowledge arguments and public-key cryptography (Q1898111) (← links)
- The power of preprocessing in zero-knowledge proofs of knowledge (Q1924193) (← links)
- Randomness complexity of private computation (Q1961058) (← links)
- Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model (Q2096495) (← links)
- Anamorphic encryption: private communication against a dictator (Q2170036) (← links)
- Lower bounds for differentially private RAMs (Q2292653) (← links)
- Efficient automatic simulation of parallel computation on networks of workstations (Q2492225) (← links)
- The price of defense (Q2663706) (← links)
- (Q2754163) (← 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)
- Logit Dynamics with Concurrent Updates for Local Interaction Games (Q2849298) (← links)
- On the Achievability of Simulation-Based Security for Functional Encryption (Q2849415) (← links)
- Predicate Encryption with Partial Public Keys (Q3058767) (← links)
- Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts (Q3059662) (← links)
- Private Capacities in Mechanism Design (Q3182917) (← links)
- Collusion-Free Multiparty Computation in the Mediated Model (Q3183583) (← links)
- On Monotone Formula Composition of Perfect Zero-Knowledge Languages (Q3395032) (← links)
- Impossibility of Black-Box Simulation Against Leakage Attacks (Q3457063) (← links)
- Minority Becomes Majority in Social Networks (Q3460778) (← links)
- Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (Q3519532) (← links)
- Hidden-Vector Encryption with Groups of Prime Order (Q3600494) (← links)
- Simulation-Based Concurrent Non-malleable Commitments and Decommitments (Q3611761) (← links)
- New Constructions of Mechanisms with Verification (Q3613793) (← links)
- (Q3789104) (← links)
- Noninteractive Zero-Knowledge (Q3985810) (← links)
- (Q4035694) (← links)
- (Q4036858) (← links)
- Removing Interaction from Zero-Knowledge Proofs (Q4206387) (← links)
- (Q4230367) (← links)
- Tight Upper and Lower Bounds on the Path Length of Binary Trees (Q4286225) (← links)
- Branch-and-bound and backtrack search on mesh-connected arrays of processors (Q4311641) (← links)
- Binary prefix codes ending in a "1" (Q4324207) (← links)
- (Q4341734) (← links)
- (Q4341789) (← links)
