UniSa - IRIS Institutional Research Information System

PERSIANO, Giuseppe
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 6.050
EU - Europa 1.426
AS - Asia 620
Continente sconosciuto - Info sul continente non disponibili 5
AF - Africa 4
OC - Oceania 4
Totale 8.109
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 6.026
UA - Ucraina 455
IT - Italia 413
CN - Cina 410
DE - Germania 142
IE - Irlanda 135
TR - Turchia 103
FI - Finlandia 101
SE - Svezia 95
VN - Vietnam 81
RU - Federazione Russa 28
CA - Canada 20
DK - Danimarca 16
GB - Regno Unito 11
IN - India 8
FR - Francia 7
JP - Giappone 6
BE - Belgio 5
EU - Europa 5
HK - Hong Kong 5
IL - Israele 4
NZ - Nuova Zelanda 4
RO - Romania 4
GR - Grecia 3
MX - Messico 3
PH - Filippine 3
CH - Svizzera 2
CM - Camerun 2
NL - Olanda 2
PL - Polonia 2
BG - Bulgaria 1
CR - Costa Rica 1
HR - Croazia 1
LT - Lituania 1
LU - Lussemburgo 1
NG - Nigeria 1
NO - Norvegia 1
SC - Seychelles 1
Totale 8.109
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.722
Woodbridge 717
Chandler 589
Jacksonville 568
Wilmington 462
Princeton 428
Houston 406
Dublin 135
Nanjing 110
Andover 107
Ashburn 105
Izmir 103
Salerno 94
Boardman 92
Pellezzano 82
Dong Ket 81
Beijing 77
Redwood City 58
Mestre 48
Shenyang 39
Fairfield 38
Dearborn 36
Hebei 32
Nanchang 30
Changsha 29
Düsseldorf 28
Jiaxing 20
Moscow 20
Ottawa 18
Tianjin 18
Norwalk 17
San Diego 17
Provo 16
Catania 13
Guangzhou 10
Rome 10
Los Angeles 9
Silvi Marina 9
Washington 9
Zhengzhou 9
Jinan 8
Cambridge 7
Casalnuovo Di Napoli 7
Pune 7
Spinea 7
Helsinki 6
Des Moines 5
New York 5
Seattle 5
Dormagen 4
Hong Kong 4
Horia 4
Osaka 4
San Jose 4
Taizhou 4
Auckland 3
Brussels 3
Falls Church 3
Florence 3
Hamburg 3
Macerata Campania 3
Melfi 3
Milan 3
Prata 3
Romano 3
Aigio 2
Avellino 2
Benevento 2
Bologna 2
Braine-l'Alleud 2
Brusciano 2
Capua 2
Castellammare Di Stabia 2
Costa Mesa 2
Dallas 2
Edinburgh 2
Frontone 2
Fuzhou 2
Hangzhou 2
Hefei 2
London 2
Los Alamitos 2
Mexico City 2
Naples 2
Ningbo 2
Old Bridge 2
Padova 2
Pagani 2
Paris 2
Plano 2
Pompei 2
San Giorgio Del Sannio 2
Serino 2
Shanghai 2
Taiyuan 2
Toronto 2
Athens 1
Atlanta 1
Baltimore 1
Central 1
Totale 6.588
Salva come PNG Salva come JPEG
Nome #
Deterministic Truthful Mechanism for Scheduling on Selfish Machines 135
Guaranteeing dependency enforcement in software updates 118
Collusion-Free Multiparty Computation in the Mediated Model 117
A linear time algorithm for the feasibility of pebble motion on treesAlgorithm Theory 112
Improved OR-Composition of Sigma-Protocols 107
Certified Information Access 106
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics 106
Alternatives to truthfulness are hard to recognize 105
Secure and Policy-Private Resource Sharing in an Online Social Network 104
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles 104
On Input Indistinguishable Proof Systems 103
Stability and metastability of the logit dynamics of strategic games 103
Online/offline or composition of sigma protocols 102
Validating Orchestration of Web Services with BPEL and Aggregate Signatures 99
Mixing Time and Stationary Expected Social Welfare of Logit Dynamic 99
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees 96
User privacy issues regarding certificates and the TLS protocol 96
Simulation-Based Concurrent Non-malleable Commitments and Decommitments 95
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games 95
Logit dynamics with concurrent updates for local interaction games 95
Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts 94
How to Route and Tax Selfish Unsplittable Traffic 93
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model 93
A Distributed Implementation of the Certified Information Access Service 93
The Design and Implementation of a Transparent Cryptographic File System for UNIX 93
Impossibility of black-box simulation against leakage attacks 93
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model 92
WAOA 2005 Special Issue of TOCS. 92
Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports 92
Minority Becomes Majority in Social Networks 92
Improved Security Notions and Protocols for Non-Transferable Identification 91
Approximation and Online Algorithms, Third International Workshop, WAOA 2005 91
An anonymous credential system and a privacy-awake PKI 91
Generalized Discrete Preference Games 91
Hidden-Vector Encryption with Groups of Prime Order 88
Metastability of Logit Dynamics for Coordination Games 88
On Monotone Formula Composition of Perfect Zero Knowledge Languages 87
Routing Selfish Unsplittable Traffic 87
Un Sistema a Garanzia dell’Anonimato su Internet 85
Untraceable Tags based on Mild Assumptions 85
Logit Dynamics with Concurrent Updates for Local Interaction Games 85
Private-Key Hidden Vector Encryption with Key Confidentiality 84
Processing Private Queries over an Obfuscated Database Using Hidden Vector Encryption 84
Constant-Round Concurrent Non-Malleable Zero Knowledge in the Bare Public-Key Model 84
Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds 82
New Constructions for Mechanisms with Verification 82
Alternatives to Truthfulness are Hard to Recognize 82
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge proofs of Knowledge for all NP relations 81
Robustness in Discrete Preference Games 81
PUBLIC KEY ENCRYPTION WITH KEYWORD SEARCH 80
Convergence to Equilibrium of Logit Dynamics for Strategic Games 80
The Power of Verification for One-Parameter Agents 79
On the Achievability of Simulation-Based Security for Functional Encryption 79
An Efficient and Usable Multi-Show Non-Transferable Anonymous Credential System 79
Randomized path Coloring on Binary Trees 78
Placing Resources on a Growing Line 78
CacheShuffle: A family of oblivious shuffles 78
Optimal Pebble motion on a Tree 77
Efficient automatic simulation of parallel computation on networks of workstations 75
Convergence to equilibrium of logit dynamics for strategic games 75
Placing resources in a tree: Dynamic and static algorithmsAutomata, Languages and Programming 73
Randomized path coloring in binary trees. 72
Sparse and Limited Wavelength Conversion in Tree Networks 72
Randomness-Optimal Characterization of Two NP Proof Systems 71
Approximate constrained bipartite edge coloring. 71
Randomness recycling in constant-round private computations. 69
Placing Resource on a Growing Line 67
Approximate constrained bipartite edge coloring 67
Un'Architettura Scalabile per Servizi di Time-Stamping 67
The Randomness Complexity of Private Computation 66
Fully Secure Hidden Vector Encryption 66
Sparse and Limited Wavelenght Conversion in Tree Networks 65
ncreasing Privacy Threats in the Cyberspace: the Case of Italian E-Passports 64
Dynamic and Static Algorithms for Optimal Placement of Resources in Trees 64
Predicate Encryption with Partial Public Keys 64
Low-randomness constant-round private XOR computations 63
The power of verification for one-parameter agents 62
Interference Games in Wireless Networks 62
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP 61
Constrained bipartite edge coloring with applications to wavelength routing 61
Providing Privacy for Web Services by Anonymous Group Identification 59
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge 57
A secure and private system for subscription-based remote services 56
On NC1 Boolean Circuit Composition of Non-Interactive Perfect Zero Knowledge 56
Controlled homomorphic encryption: Definition and construction 56
Distributed Certified Information Access for Mobile Devices 56
On designing truthful Mechanisms for online scheduling 55
Symmetric communication in all-optical tree networks 54
A lightweight privacy preserving SMS-based recommendation system for mobile users 54
Information security for sensors by overwhelming random sequences and permutations 52
A new approach to optimal planning of robot motion on a tree with obstaclesAlgorithms — ESA '96 52
The graph clustering problem has a perfect zero-knowledge interactive proof. 51
The Price of Defense and Fractional Matchings 50
Metastability of logit dynamics for coordination games 49
Optimal and approximate station placement in networks (with applications to multicasting and space efficient traversal). 49
Robust non-interactive zero knowledge. 48
Station Placement in Networks 48
Impossibility and Feasibility Results for Zero Knowledge with Public Keys 48
Edge coloring of bipartite graphs with constraints. 47
Efficient automatic simulation of parallel computation on networks of workstations. 46
Totale 7.881
Salva come PNG Salva come JPEG
Categoria #
all - tutte 20.785
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 20.785
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019159 0 0 0 0 0 0 0 0 0 0 151 8
2019/2020990 267 13 108 6 88 12 113 6 97 72 186 22
2020/2021937 8 98 96 2 133 54 111 3 226 2 99 105
2021/2022787 1 2 0 28 21 22 4 35 111 103 105 355
2022/20231.280 145 104 31 180 182 256 1 115 181 8 57 20
2023/2024355 55 94 27 15 28 37 29 27 9 34 0 0
Totale 8.437