PERSIANO, Giuseppe
 Distribuzione geografica
Continente #
AS - Asia 16.622
NA - Nord America 6.592
EU - Europa 1.839
SA - Sud America 314
AF - Africa 27
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 5
Totale 25.405
Nazione #
HK - Hong Kong 15.104
US - Stati Uniti d'America 6.540
CN - Cina 724
IT - Italia 463
UA - Ucraina 458
SG - Singapore 443
RU - Federazione Russa 289
BR - Brasile 286
DE - Germania 173
IE - Irlanda 139
TR - Turchia 112
VN - Vietnam 110
FI - Finlandia 106
SE - Svezia 99
KR - Corea 55
CA - Canada 32
GB - Regno Unito 25
DK - Danimarca 16
IN - India 16
FR - Francia 15
JP - Giappone 11
MX - Messico 11
AT - Austria 10
BD - Bangladesh 10
PL - Polonia 10
IQ - Iraq 8
UZ - Uzbekistan 8
AL - Albania 6
AR - Argentina 6
ZA - Sudafrica 6
BE - Belgio 5
CL - Cile 5
EU - Europa 5
IL - Israele 5
MA - Marocco 5
RO - Romania 5
VE - Venezuela 5
CR - Costa Rica 4
CZ - Repubblica Ceca 4
EC - Ecuador 4
NZ - Nuova Zelanda 4
GR - Grecia 3
KE - Kenya 3
NL - Olanda 3
PH - Filippine 3
PK - Pakistan 3
AE - Emirati Arabi Uniti 2
BO - Bolivia 2
BS - Bahamas 2
CH - Svizzera 2
CM - Camerun 2
NP - Nepal 2
PE - Perù 2
PY - Paraguay 2
SN - Senegal 2
AZ - Azerbaigian 1
BB - Barbados 1
BG - Bulgaria 1
BN - Brunei Darussalam 1
BY - Bielorussia 1
CO - Colombia 1
CW - ???statistics.table.value.countryCode.CW??? 1
DO - Repubblica Dominicana 1
DZ - Algeria 1
EG - Egitto 1
ES - Italia 1
ET - Etiopia 1
GA - Gabon 1
HR - Croazia 1
JM - Giamaica 1
JO - Giordania 1
KZ - Kazakistan 1
LB - Libano 1
LT - Lituania 1
LU - Lussemburgo 1
MW - Malawi 1
NG - Nigeria 1
NO - Norvegia 1
PF - Polinesia Francese 1
RS - Serbia 1
SC - Seychelles 1
TL - Timor Orientale 1
UG - Uganda 1
UY - Uruguay 1
ZM - Zambia 1
Totale 25.405
Città #
Hong Kong 15.087
Ann Arbor 1.722
Woodbridge 717
Chandler 589
Jacksonville 569
Wilmington 462
Princeton 428
Houston 407
Dallas 257
Singapore 192
Beijing 152
Ashburn 138
Dublin 138
Nanjing 112
Andover 107
Izmir 103
Salerno 94
Boardman 92
Pellezzano 82
Dong Ket 81
Moscow 77
Redwood City 58
Mestre 48
Shenyang 39
Fairfield 38
Dearborn 36
Hebei 32
Changsha 30
Los Angeles 30
Nanchang 30
Düsseldorf 28
Guangzhou 23
Jiaxing 21
Tianjin 20
Columbus 19
Ottawa 18
Norwalk 17
Rome 17
San Diego 17
São Paulo 17
The Dalles 17
New York 16
Provo 16
Munich 15
Santa Clara 15
Zhengzhou 15
Catania 13
Ho Chi Minh City 13
Milan 13
Naples 12
Nuremberg 12
Brooklyn 10
Washington 10
Rio de Janeiro 9
Silvi Marina 9
Chicago 8
Helsinki 8
Jinan 8
London 8
Boston 7
Cambridge 7
Casalnuovo Di Napoli 7
Council Bluffs 7
Hanoi 7
Paris 7
Pune 7
Seattle 7
Spinea 7
Tashkent 7
Warsaw 7
Belo Horizonte 6
Mexico City 6
Porto Alegre 6
Taizhou 6
Tokyo 6
Des Moines 5
Johannesburg 5
San Jose 5
Shanghai 5
Tirana 5
Brasília 4
Charlotte 4
Chennai 4
Dormagen 4
Duque de Caxias 4
Fuzhou 4
Guarulhos 4
Horia 4
Joinville 4
Lappeenranta 4
Montreal 4
Olomouc 4
Osaka 4
San José 4
Santiago 4
Tsuen Wan 4
Vienna 4
Atlanta 3
Auckland 3
Baghdad 3
Totale 22.580
Nome #
A new approach to optimal planning of robot motion on a tree with obstaclesAlgorithms — ESA '96 2.618
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles 1.126
Alternatives to truthfulness are hard to recognize 1.031
Guaranteeing dependency enforcement in software updates 936
Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts 932
Online/offline or composition of sigma protocols 930
Anamorphic Encryption: Private Communication Against a Dictator 638
Processing Private Queries over an Obfuscated Database Using Hidden Vector Encryption 562
Predicate Encryption with Partial Public Keys 540
Station Placement in Networks 521
Distributed Certified Information Access for Mobile Devices 515
Efficient automatic simulation of parallel computation on networks of workstations 493
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics 403
Constant-Round Concurrent Non-Malleable Zero Knowledge in the Bare Public-Key Model 358
Simulation-Based Concurrent Non-malleable Commitments and Decommitments 353
WAOA 2005 Special Issue of TOCS. 352
Logit Dynamics with Concurrent Updates for Local Interaction Games 351
Improved Security Notions and Protocols for Non-Transferable Identification 350
PUBLIC KEY ENCRYPTION WITH KEYWORD SEARCH 339
Sparse and Limited Wavelenght Conversion in Tree Networks 330
Stability and metastability of the logit dynamics of strategic games 329
Fully Secure Hidden Vector Encryption 316
The Power of Verification for One-Parameter Agents 315
Hidden-vector encryption with groups of prime order 287
A Distributed Implementation of the Certified Information Access Service 249
Deterministic Truthful Mechanism for Scheduling on Selfish Machines 248
On Input Indistinguishable Proof Systems 241
Generalized Discrete Preference Games 232
The Randomness Complexity of Private Computation 228
Untraceable Tags based on Mild Assumptions 226
Third International Conference Security in Communication Networks 226
A secure and private system for subscription-based remote services 224
Necessary and Sufficient Assumptions for Non-Interactive Zero-Knowledge proofs of Knowledge for all NP relations 221
Un Sistema a Garanzia dell’Anonimato su Internet 209
Convergence to Equilibrium of Logit Dynamics for Strategic Games 190
Placing Resources on a Growing Line 188
The power of verification for one-parameter agents 160
Randomized path Coloring on Binary Trees 153
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP 152
Minority Becomes Majority in Social Networks 152
Secure and Policy-Private Resource Sharing in an Online Social Network 151
CacheShuffle: A family of oblivious shuffles 150
Private-Key Hidden Vector Encryption with Key Confidentiality 149
A linear time algorithm for the feasibility of pebble motion on treesAlgorithm Theory 149
Collusion-Free Multiparty Computation in the Mediated Model 146
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model 144
Impossibility of black-box simulation against leakage attacks 142
Logit dynamics with concurrent updates for local interaction games 140
Certified Information Access 139
Robustness in Discrete Preference Games 134
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption 131
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees 130
Improved OR-Composition of Sigma-Protocols 130
An anonymous credential system and a privacy-awake PKI 127
Dynamic and Static Algorithms for Optimal Placement of Resources in Trees 127
Mixing Time and Stationary Expected Social Welfare of Logit Dynamic 123
How to Route and Tax Selfish Unsplittable Traffic 119
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games 115
Metastability of Logit Dynamics for Coordination Games 115
Approximation and Online Algorithms, Third International Workshop, WAOA 2005 114
Approximate constrained bipartite edge coloring. 114
Routing Selfish Unsplittable Traffic 113
Validating Orchestration of Web Services with BPEL and Aggregate Signatures 112
Alternatives to Truthfulness are Hard to Recognize 110
New Constructions for Mechanisms with Verification 109
User privacy issues regarding certificates and the TLS protocol 107
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model 104
The Design and Implementation of a Transparent Cryptographic File System for UNIX 104
Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports 103
Continuously non-malleable codes in the split-state model from minimal assumptions 103
Robust non-interactive zero knowledge. 101
Convergence to equilibrium of logit dynamics for strategic games 101
An Efficient and Usable Multi-Show Non-Transferable Anonymous Credential System 101
On the Achievability of Simulation-Based Security for Functional Encryption 100
Providing Privacy for Web Services by Anonymous Group Identification 99
Hidden-Vector Encryption with Groups of Prime Order 99
On Monotone Formula Composition of Perfect Zero Knowledge Languages 99
Randomized path coloring in binary trees. 98
On designing truthful Mechanisms for online scheduling 96
Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds 95
Randomness recycling in constant-round private computations. 93
Placing resources in a tree: Dynamic and static algorithmsAutomata, Languages and Programming 92
Approximate constrained bipartite edge coloring 90
Un'Architettura Scalabile per Servizi di Time-Stamping 90
Optimal Pebble motion on a Tree 88
Placing Resource on a Growing Line 87
Sparse and Limited Wavelength Conversion in Tree Networks 86
Efficient automatic simulation of parallel computation on networks of workstations. 84
ncreasing Privacy Threats in the Cyberspace: the Case of Italian E-Passports 84
Controlled homomorphic encryption: Definition and construction 84
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge 83
Constrained bipartite edge coloring with applications to wavelength routing 81
A lightweight privacy preserving SMS-based recommendation system for mobile users 81
Randomness-Optimal Characterization of Two NP Proof Systems 80
Interference Games in Wireless Networks 79
The Price of Defense and Fractional Matchings 78
Lower bounds for encrypted multi-maps and searchable encryption in the leakage cell probe model 75
Low-randomness constant-round private XOR computations 71
Symmetric communication in all-optical tree networks 70
Information security for sensors by overwhelming random sequences and permutations 69
Totale 24.612
Categoria #
all - tutte 53.583
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 53.583


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021831 0 0 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/2024454 55 94 27 15 28 37 29 27 9 34 15 84
2024/20252.280 77 23 22 72 55 142 287 163 193 131 140 975
2025/202614.937 5.196 6.482 3.259 0 0 0 0 0 0 0 0 0
Totale 25.753