default search action
Giuseppe Persiano
Pino Persiano
Person information
- affiliation: University of Salerno, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c117]Sarvar Patel
, Giuseppe Persiano
Efficient Secret Sharing for Large-Scale Applications. CCS 2024: 3065-3079 - [c116]Giuseppe Persiano
Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond. CRYPTO (2) 2024: 422-455 - [c115]Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano
Optimal Non-Adaptive Cell Probe Dictionaries and Hashing. ICALP 2024: 104:1-104:12 - [i50]Alexander Hoover, Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Plinko: Single-Server PIR with Efficient Updates via Invertible PRFs. IACR Cryptol. ePrint Arch. 2024: 318 (2024) - [i49]Sarvar Patel, Giuseppe Persiano, Joon Young Seo, Kevin Yeo:
Efficient Secret Sharing for Large-Scale Applications. IACR Cryptol. ePrint Arch. 2024: 1045 (2024) - [i48]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Public-Key Anamorphism in (CCA-secure) Public-Key Encryption and Beyond. IACR Cryptol. ePrint Arch. 2024: 1327 (2024) - 2023
- [j60]Ghous Amjad, Sarvar Patel, Giuseppe Persiano
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. Proc. Priv. Enhancing Technol. 2023(1): 417-436 (2023) - [j59]Miroslaw Kutylowski, Giuseppe Persiano
The Self-Anti-Censorship Nature of Encryption: On the Prevalence of Anamorphic Cryptography. Proc. Priv. Enhancing Technol. 2023(4): 170-183 (2023) - [c114]Giuseppe Persiano:
The Complexity of Secure RAMs. CIAC 2023: 17-20 - [c113]Giuseppe Persiano
Limits of Breach-Resistant and Snapshot-Oblivious RAMs. CRYPTO (4) 2023: 161-196 - [c112]Miroslaw Kutylowski, Giuseppe Persiano
Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication! CRYPTO (2) 2023: 759-790 - [c111]Giuseppe Persiano
Lower Bound Framework for Differentially Private and Oblivious Data Structures. EUROCRYPT (1) 2023: 487-517 - [i47]Mirek Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
Anamorphic Signatures: Secrecy From a Dictator Who Only Permits Authentication! IACR Cryptol. ePrint Arch. 2023: 356 (2023) - [i46]Mirek Kutylowski, Giuseppe Persiano, Duong Hieu Phan, Moti Yung, Marcin Zawada:
The Self-Anti-Censorship Nature of Encryption: On the Prevalence of Anamorphic Cryptography. IACR Cryptol. ePrint Arch. 2023: 434 (2023) - [i45]Giuseppe Persiano, Kevin Yeo:
Limits of Breach-Resistant and Snapshot-Oblivious RAMs. IACR Cryptol. ePrint Arch. 2023: 811 (2023) - 2022
- [j58]Angelo Massimo Perillo, Giuseppe Persiano, Alberto Trombetta:
Secure Selections on Encrypted Multi-writer Streams. ACM Trans. Priv. Secur. 25(1): 7:1-7:33 (2022) - [c110]Giuseppe Persiano
Anamorphic Encryption: Private Communication Against a Dictator. EUROCRYPT (2) 2022: 34-63 - [c109]Giuseppe Persiano
Limits of Preprocessing for Single-Server PIR. SODA 2022: 2522-2548 - [i44]Giuseppe Persiano, Kevin Yeo:
Limits of Preprocessing for Single-Server PIR. IACR Cryptol. ePrint Arch. 2022: 235 (2022) - [i43]Giuseppe Persiano, Duong Hieu Phan, Moti Yung:
Anamorphic Encryption: Private Communication against a Dictator. IACR Cryptol. ePrint Arch. 2022: 639 (2022) - [i42]Giuseppe Persiano, Kevin Yeo:
Lower Bound Framework for Differentially Private and Oblivious Data Structures. IACR Cryptol. ePrint Arch. 2022: 1553 (2022) - 2021
- [j57]Marios Mavronicolas
The Price of Defense. Algorithmica 83(5): 1256-1315 (2021) - [c108]Sarvar Patel, Giuseppe Persiano
Efficient Boolean Search over Encrypted Data with Reduced Leakage. ASIACRYPT (3) 2021: 577-607 - [i41]Ghous Amjad, Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Dynamic Volume-Hiding Encrypted Multi-Maps with Applications to Searchable Encryption. IACR Cryptol. ePrint Arch. 2021: 765 (2021) - [i40]Sarvar Patel, Giuseppe Persiano, Joon Young Seo, Kevin Yeo:
Efficient Boolean Search over Encrypted Data with Reduced Leakage. IACR Cryptol. ePrint Arch. 2021: 1227 (2021) - 2020
- [j56]Luigi Catuogno
Secure Dependency Enforcement in Package Management Systems. IEEE Trans. Dependable Secur. Comput. 17(2): 377-390 (2020) - [c107]Sarvar Patel, Giuseppe Persiano
Lower Bounds for Encrypted Multi-Maps and Searchable Encryption in the Leakage Cell Probe Model. CRYPTO (1) 2020: 433-463 - [i39]Giuseppe Persiano, Kevin Yeo:
Tight Static Lower Bounds for Non-Adaptive Data Structures. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c106]Sarvar Patel, Giuseppe Persiano
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing. CCS 2019: 79-93 - [c105]Giuseppe Persiano
Lower Bounds for Differentially Private RAMs. EUROCRYPT (1) 2019: 404-434 - [c104]Sarvar Patel, Giuseppe Persiano
What Storage Access Privacy is Achievable with Small Overhead? PODS 2019: 182-199 - [i38]Angelo Massimo Perillo, Giuseppe Persiano, Alberto Trombetta:
Secure selections on encrypted multi-writer streams. CoRR abs/1901.10221 (2019) - [i37]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
What Storage Access Privacy is Achievable with Small Overhead? CoRR abs/1904.05452 (2019) - [i36]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
What Storage Access Privacy is Achievable with Small Overhead? IACR Cryptol. ePrint Arch. 2019: 384 (2019) - [i35]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Leakage Cell Probe Model: Lower Bounds for Key-Equality Mitigation in Encrypted Multi-Maps. IACR Cryptol. ePrint Arch. 2019: 1132 (2019) - [i34]Sarvar Patel, Giuseppe Persiano, Kevin Yeo, Moti Yung:
Mitigating Leakage in Secure Cloud-Hosted Data Structures: Volume-Hiding for Multi-Maps via Hashing. IACR Cryptol. ePrint Arch. 2019: 1292 (2019) - 2018
- [j55]Vincenzo Auletta
Metastability of Logit Dynamics for Coordination Games. Algorithmica 80(11): 3078-3131 (2018) - [c103]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Private Stateful Information Retrieval. CCS 2018: 1002-1019 - [c102]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. CRYPTO (3) 2018: 608-639 - [c101]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Symmetric Searchable Encryption with Sharing and Unsharing. ESORICS (2) 2018: 207-227 - [c100]Sarvar Patel, Giuseppe Persiano, Mariana Raykova, Kevin Yeo:
PanORAMa: Oblivious RAM with Logarithmic Overhead. FOCS 2018: 871-882 - [c99]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
CacheShuffle: A Family of Oblivious Shuffles. ICALP 2018: 161:1-161:13 - [i33]Giuseppe Persiano, Kevin Yeo:
Lower Bounds for Differentially Private RAMs. Electron. Colloquium Comput. Complex. TR18 (2018) - [i32]Sarvar Patel, Giuseppe Persiano, Mariana Raykova, Kevin Yeo:
PanORAMa: Oblivious RAM with Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2018: 373 (2018) - [i31]Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti:
Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2018: 542 (2018) - [i30]Giuseppe Persiano, Kevin Yeo:
Lower Bounds for Differentially Private RAMs. IACR Cryptol. ePrint Arch. 2018: 1051 (2018) - [i29]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Private Stateful Information Retrieval. IACR Cryptol. ePrint Arch. 2018: 1083 (2018) - 2017
- [j54]Paul G. Spirakis, Leslie Ann Goldberg, Antonín Kucera, Giuseppe Persiano:
Statement from EATCS President and vice Presidents about the recent US travel restrictions to foreigners. Bull. EATCS 121 (2017) - [j53]Giuseppe Persiano:
EATCS Distinguished Dissertation Award 2017 - Call for Nominations. Bull. EATCS 123 (2017) - [c98]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Robustness in Discrete Preference Games. AAMAS 2017: 1314-1322 - [c97]Angelo Massimo Perillo
Secure Queries on Encrypted Multi-writer Tables. EuroS&P 2017: 127-141 - [c96]Yvo Desmedt, Vincenzo Iovino
Controlled Homomorphic Encryption: Definition and Construction. Financial Cryptography Workshops 2017: 107-129 - [c95]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Information Retention in Heterogeneous Majority Dynamics. WINE 2017: 30-43 - [i28]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
CacheShuffle: An Oblivious Shuffle Algorithm Using Caches. CoRR abs/1705.07069 (2017) - [i27]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Recursive ORAMs with Practical Constructions. IACR Cryptol. ePrint Arch. 2017: 964 (2017) - [i26]Sarvar Patel, Giuseppe Persiano, Kevin Yeo:
Symmetric Searchable Encryption with Sharing and Unsharing. IACR Cryptol. ePrint Arch. 2017: 973 (2017) - 2016
- [j52]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale
Convergence to Equilibrium of Logit Dynamics for Strategic Games. Algorithmica 76(1): 110-142 (2016) - [j51]Michele Flammini, Giuseppe Persiano:
Report on 1st GSSI Summer Meeting on Algorithms. Bull. EATCS 120 (2016) - [j50]Giuseppe Persiano:
EATCS Distinguished Dissertation Award 2016 - Call for Nominations. Bull. EATCS 120 (2016) - [c94]Michele Ciampi
Online/Offline OR Composition of Sigma Protocols. EUROCRYPT (2) 2016: 63-92 - [c93]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Generalized Discrete Preference Games. IJCAI 2016: 53-59 - [c92]Michele Ciampi
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. TCC (A2) 2016: 83-111 - [c91]Michele Ciampi
Improved OR-Composition of Sigma-Protocols. TCC (A2) 2016: 112-141 - [e11]Sara Foresti, Giuseppe Persiano:
Cryptology and Network Security - 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings. Lecture Notes in Computer Science 10052, 2016, ISBN 978-3-319-48964-3 [contents] - [e10]Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang:
Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I. Lecture Notes in Computer Science 9614, Springer 2016, ISBN 978-3-662-49383-0 [contents] - [e9]Chen-Mou Cheng, Kai-Min Chung, Giuseppe Persiano, Bo-Yin Yang:
Public-Key Cryptography - PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II. Lecture Notes in Computer Science 9615, Springer 2016, ISBN 978-3-662-49386-1 [contents] - [i25]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Discrete Preference Games in Heterogeneous Social Networks: Subverted Majorities and the Swing Player. CoRR abs/1603.02971 (2016) - [i24]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Online/Offline OR Composition of Sigma Protocols. IACR Cryptol. ePrint Arch. 2016: 175 (2016) - 2015
- [j49]Vincenzo Auletta
Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. Algorithmica 73(3): 511-546 (2015) - [j48]Giuseppe Persiano:
EATCS Distinguished Dissertation Award 2015 - Call for Nominations. Bull. EATCS 117 (2015) - [j47]Roberto Solis-Oba, Giuseppe Persiano:
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 1-2 (2015) - [j46]Thomas Erlebach
Special Issue on Approximation and Online Algorithms. Theory Comput. Syst. 56(1): 135-136 (2015) - [c90]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Impossibility of Black-Box Simulation Against Leakage Attacks. CRYPTO (2) 2015: 130-149 - [c89]Luigi Catuogno, Clemente Galdi
Guaranteeing Dependency Enforcement in Software Updates. NordSec 2015: 205-212 - [c88]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi
Minority Becomes Majority in Social Networks. WINE 2015: 74-88 - [i23]Michele Ciampi, Giuseppe Persiano, Luisa Siniscalchi, Ivan Visconti:
A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles. IACR Cryptol. ePrint Arch. 2015: 770 (2015) - [i22]Michele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti:
Improved OR Composition of Sigma-Protocols. IACR Cryptol. ePrint Arch. 2015: 810 (2015) - 2014
- [j45]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. Ad Hoc Networks 12: 193-200 (2014) - [j44]Giuseppe Persiano:
EATCS Distinguished Dissertation Award 2014 - Call for Nominations. Bull. EATCS 114 (2014) - [j43]Luca Becchetti
A lightweight privacy preserving SMS-based recommendation system for mobile users. Knowl. Inf. Syst. 40(1): 49-77 (2014) - [j42]Giuseppe Persiano:
Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 54(3): 373-374 (2014) - [c87]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
On Input Indistinguishable Proof Systems. ICALP (1) 2014: 895-906 - [c86]Alberto Trombetta
Processing Private Queries over an Obfuscated Database Using Hidden Vector Encryption. NordSec 2014: 94-109 - [i21]Vincenzo Auletta, Ioannis Caragiannis, Diodato Ferraioli, Clemente Galdi, Giuseppe Persiano:
Discrete preference games: social influence through coordination, and beyond. CoRR abs/1402.4050 (2014) - [i20]Alberto Trombetta, Giuseppe Persiano, Stefano Braghin:
Answering queries using pairings. CoRR abs/1403.2514 (2014) - [i19]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Impossibility Results for Leakage-Resilient Zero Knowledge and Multi-Party Computation. IACR Cryptol. ePrint Arch. 2014: 865 (2014) - [i18]Yvo Desmedt, Vincenzo Iovino, Giuseppe Persiano, Ivan Visconti:
Controlled Homomorphic Encryption: Definition and Construction. IACR Cryptol. ePrint Arch. 2014: 989 (2014) - 2013
- [j41]Carlo Blundo
Certified Information Access. J. Syst. Softw. 86(9): 2439-2450 (2013) - [j40]Vincenzo Auletta
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. Theory Comput. Syst. 53(1): 3-40 (2013) - [c85]Angelo De Caro, Vincenzo Iovino
On the Achievability of Simulation-Based Security for Functional Encryption. CRYPTO (2) 2013: 519-535 - [c84]Vincenzo Auletta
Logit Dynamics with Concurrent Updates for Local Interaction Games. ESA 2013: 73-84 - [e8]Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms - 10th International Workshop, WAOA 2012, Ljubljana, Slovenia, September 13-14, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7846, Springer 2013, ISBN 978-3-642-38015-0 [contents] - [i17]Stefano Braghin, Vincenzo Iovino, Giuseppe Persiano, Alberto Trombetta:
Secure and Policy-Private Resource Sharing in an Online Social Network. CoRR abs/1307.2756 (2013) - [i16]Angelo De Caro, Vincenzo Iovino, Abhishek Jain
On the Achievability of Simulation-Based Security for Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 364 (2013) - 2012
- [c83]Giuseppe Persiano:
Stability and Metastability of the Logit Dynamics of Strategic Games. FUN 2012: 2 - [c82]Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano:
Fully Secure Hidden Vector Encryption. Pairing 2012: 102-121 - [c81]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano:
Metastability of logit dynamics for coordination games. SODA 2012: 1006-1024 - [e7]Roberto Solis-Oba, Giuseppe Persiano:
Approximation and Online Algorithms - 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7164, Springer 2012, ISBN 978-3-642-29115-9 [contents] - [i15]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates. CoRR abs/1207.2908 (2012) - [i14]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano:
Convergence to Equilibrium of Logit Dynamics for Strategic Games. CoRR abs/1212.1884 (2012) - 2011
- [j39]Vincenzo Auletta
Alternatives to truthfulness are hard to recognize. Auton. Agents Multi Agent Syst. 22(1): 200-216 (2011) - [j38]Vincenzo Auletta
A response to "Mechanism Design with Partial Verification and Revelation Principle". Auton. Agents Multi Agent Syst. 22(1): 224 (2011) - [j37]Carlo Blundo
Innovative approaches for security of small artefacts. Comput. Sci. Rev. 5(1): 47-55 (2011) - [c80]Stefano Braghin
Secure and Policy-Private Resource Sharing in an Online Social Network. SocialCom/PASSAT 2011: 872-875 - [c79]Vincenzo Auletta
Convergence to equilibrium of logit dynamics for strategic games. SPAA 2011: 197-206 - [e6]Giuseppe Persiano:
Algorithmic Game Theory, 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6982, Springer 2011, ISBN 978-3-642-24828-3 [contents] - [i13]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano:
Metastability of Logit Dynamics for Coordination Games. CoRR abs/1107.4537 (2011) - [i12]Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano:
Hidden Vector Encryption Fully Secure Against Unrestricted Queries. IACR Cryptol. ePrint Arch. 2011: 546 (2011) - 2010
- [c78]Carlo Blundo
Predicate Encryption with Partial Public Keys. CANS 2010: 298-313 - [c77]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. CCS 2010: 669-671 - [c76]Shlomi Dolev
Information security for sensors by overwhelming random sequences and permutations. DIALM-PODC 2010: 43-48 - [c75]Vincenzo Auletta
Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports. Financial Cryptography Workshops 2010: 94-104 - [c74]Angelo De Caro, Vincenzo Iovino
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts. Pairing 2010: 347-366 - [c73]Elisa Baglioni, Luca Becchetti
A lightweight privacy preserving SMS-based recommendation system for mobile users. RecSys 2010: 191-198 - [c72]Vincenzo Auletta
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. SAGT 2010: 54-65 - [c71]Giuseppe Persiano:
Predicate Encryption for Secure Remote Storage. TGC 2010: 87 - [i11]Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano:
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics. CoRR abs/1002.3474 (2010) - [i10]Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano:
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts. IACR Cryptol. ePrint Arch. 2010: 197 (2010) - [i9]Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano:
Predicate Encryption with Partial Public Keys. IACR Cryptol. ePrint Arch. 2010: 476 (2010) - [i8]Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano:
Efficient Fully Secure (Hierarchical) Predicate Encryption for Conjunctions, Disjunctions and k-CNF/DNF formulae. IACR Cryptol. ePrint Arch. 2010: 492 (2010)
2000 – 2009
- 2009
- [j36]Vincenzo Auletta
The power of verification for one-parameter agents. J. Comput. Syst. Sci. 75(3): 190-211 (2009) - [j35]Vincenzo Auletta
On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. 410(36): 3348-3356 (2009) - [c70]Carlo Blundo
Private-Key Hidden Vector Encryption with Key Confidentiality. CANS 2009: 259-277 - [c69]Joël Alwen, Jonathan Katz, Yehuda Lindell
Collusion-Free Multiparty Computation in the Mediated Model. CRYPTO 2009: 524-540 - [c68]Carlo Blundo
Untraceable Tags Based on Mild Assumptions. DPM/SETOP 2009: 178-192 - [c67]Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano:
Private-Key Hidden Vector Encryption with Key Privacy. ICTCS 2009: 46-50 - [c66]Vincenzo Auletta
Private Capacities in Mechanism Design. MFCS 2009: 112-123 - [c65]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Simulation-Based Concurrent Non-malleable Commitments and Decommitments. TCC 2009: 91-108 - [e5]Alessandra Cherubini, Mario Coppo, Giuseppe Persiano:
Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings. 2009 [contents] - [r1]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
Directed Tree Networks. Encyclopedia of Optimization 2009: 716-725 - [i7]Carlo Blundo, Angelo De Caro, Giuseppe Persiano:
Untraceable Tags based on Mild Assumptions. IACR Cryptol. ePrint Arch. 2009: 380 (2009) - 2008
- [j34]Thomas Erlebach
WAOA 2005 Special Issue of TOCS. Theory Comput. Syst. 43(1): 1-2 (2008) - [j33]Alfredo De Santis
On Monotone Formula Composition of Perfect Zero-Knowledge Languages. SIAM J. Comput. 38(4): 1300-1329 (2008) - [c64]Carlo Blundo
Validating Orchestration of Web Services with BPEL and Aggregate Signatures. ECOWS 2008: 205-214 - [c63]Carlo Blundo, Giuseppe Persiano, Ahmad-Reza Sadeghi, Ivan Visconti:
Improved Security Notions and Protocols for Non-transferable Identification. ESORICS 2008: 364-378 - [c62]Carlo Blundo, Emiliano De Cristofaro, Aniello Del Sorbo, Clemente Galdi, Giuseppe Persiano:
A Distributed Implementation of the Certified Information Access Service. ESORICS 2008: 396-410 - [c61]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. ICALP (2) 2008: 548-559 - [c60]Vincenzo Iovino
Hidden-Vector Encryption with Groups of Prime Order. Pairing 2008: 75-88 - [c59]Vincenzo Auletta
Alternatives to Truthfulness Are Hard to Recognize. SAGT 2008: 194-205 - [c58]Vincenzo Auletta
Interference Games in Wireless Networks. WINE 2008: 278-285 - [i6]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent Non-Malleable Commitments and Decommitments. IACR Cryptol. ePrint Arch. 2008: 235 (2008) - 2007
- [j32]Carlo Blundo
Low-randomness constant-round private XOR computations. Int. J. Inf. Sec. 6(1): 15-26 (2007) - [j31]Vincenzo Auletta
Routing selfish unsplittable traffic. ACM Trans. Algorithms 3(4): 52 (2007) - [c57]Aniello Del Sorbo, Clemente Galdi, Giuseppe Persiano:
Distributed Certified Information Access for Mobile Devices. WISTP 2007: 67-79 - 2006
- [j30]Christos Kaklamanis, Danny Krizanc, Manuela Montangero
Efficient automatic simulation of parallel computation on networks of workstations. Discret. Appl. Math. 154(10): 1500-1509 (2006) - [c56]Vincenzo Auletta
New Constructions of Mechanisms with Verification. ICALP (1) 2006: 596-607 - [c55]Marios Mavronicolas
The Price of Defense and Fractional Matchings. ICDCN 2006: 115-126 - [c54]Giuseppe Persiano, Ivan Visconti:
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model. MFCS 2006: 753-764 - [p1]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Approximation Algorithms for Path Coloring in Trees. Efficient Approximation and Online Algorithms 2006: 74-96 - [e4]Thomas Erlebach, Giuseppe Persiano:
Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers. Lecture Notes in Computer Science 3879, Springer 2006, ISBN 3-540-32207-8 [contents] - [i5]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Concurrent Non-Malleable Witness Indistinguishability and its Applications. Electron. Colloquium Comput. Complex. TR06 (2006) - [i4]Rafail Ostrovsky, Giuseppe Persiano, Ivan Visconti:
Constant-Round Concurrent NMWI and its relation to NMZK. IACR Cryptol. ePrint Arch. 2006: 256 (2006) - 2005
- [j29]Clemente Galdi
Station Placement in Networks. Parallel Process. Lett. 15(1-2): 117-130 (2005) - [c53]Joël Alwen, Giuseppe Persiano, Ivan Visconti:
Impossibility and Feasibility Results for Zero Knowledge with Public Keys. CRYPTO 2005: 135-151 - [c52]Giuseppe Persiano, Ivan Visconti:
Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds. ICALP 2005: 228-240 - [c51]Vincenzo Auletta, Roberto De Prisco
On Designing Truthful Mechanisms for Online Scheduling. SIROCCO 2005: 3-17 - [e3]Giuseppe Persiano, Roberto Solis-Oba:
Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3351, Springer 2005, ISBN 3-540-24574-X [contents] - 2004
- [j28]Ioannis Caragiannis
Approximate constrained bipartite edge coloring. Discret. Appl. Math. 143(1-3): 54-61 (2004) - [c50]Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti:
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge. ASIACRYPT 2004: 530-544 - [c49]Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti:
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. CRYPTO 2004: 237-253 - [c48]Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano:
Public Key Encryption with Keyword Search. EUROCRYPT 2004: 506-522 - [c47]Giuseppe Persiano, Ivan Visconti:
An Efficient and Usable Multi-show Non-transferable Anonymous Credential System. Financial Cryptography 2004: 196-211 - [c46]Vincenzo Auletta, Roberto De Prisco
The Power of Verification for One-Parameter Agents. ICALP 2004: 171-182 - [c45]Giuseppe Cattaneo
Providing Privacy for Web Services by Anonymous Group Identification. ICWS 2004: 166-173 - [c44]Alfredo De Santis
On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge. MFCS 2004: 356-367 - [c43]Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano:
How to route and tax selfish unsplittable traffic. SPAA 2004: 196-205 - [c42]Vincenzo Auletta, Roberto De Prisco
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. STACS 2004: 608-619 - 2003
- [j27]Pino Persiano, Ivan Visconti:
A secure and private system for subscription-based remote services. ACM Trans. Inf. Syst. Secur. 6(4): 472-500 (2003) - [c41]Pino Persiano, Ivan Visconti:
An Anonymous Credential System and a Privacy-Aware PKI. ACISP 2003: 27-38 - [c40]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano, Anastasios Sidiropoulos:
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees. WAOA 2003: 81-94 - [e2]Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri:
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings. Lecture Notes in Computer Science 2653, Springer 2003, ISBN 3-540-40176-8 [contents] - [e1]Stelvio Cimato, Clemente Galdi, Giuseppe Persiano:
Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers. Lecture Notes in Computer Science 2576, Springer 2003, ISBN 3-540-00420-3 [contents] - [i3]Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano:
Public Key Encryption with keyword Search. IACR Cryptol. ePrint Arch. 2003: 195 (2003) - 2002
- [j26]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Wavelength Routing in All-Optical Tree Networks: A Survey. Bull. EATCS 76: 104-124 (2002) - [j25]Ioannis Caragiannis
Edge coloring of bipartite graphs with constraints. Theor. Comput. Sci. 270(1-2): 361-399 (2002) - [j24]Vincenzo Auletta
Randomized path coloring on binary trees. Theor. Comput. Sci. 289(1): 355-399 (2002) - [c39]Alfredo De Santis
Randomness-Optimal Characterization of Two NP Proof Systems. RANDOM 2002: 179-193 - 2001
- [j23]Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Wavelength Routing in All-optical Tree Networks: A Survey. Comput. Artif. Intell. 20(2): 95-120 (2001) - [j22]Vincenzo Auletta
Optimal Pebble Motion on a Tree. Inf. Comput. 165(1): 42-68 (2001) - [j21]Vincenzo Auletta
Sparse and limited wavelength conversion in all-optical tree networks. Theor. Comput. Sci. 266(1-2): 887-934 (2001) - [c38]Alfredo De Santis
Robust Non-interactive Zero Knowledge. CRYPTO 2001: 566-598 - [c37]Clemente Galdi, Pino Persiano:
Private Computation with Shared Randomness over Broadcast Channel. ICISC 2001: 244-257 - [c36]Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Pino Persiano:
Optimal and Approximate Station Placement in Networks (With Applications to Multicasting and Space Efficient Traversals). STACS 2001: 271-282 - [c35]Giuseppe Cattaneo, Luigi Catuogno, Aniello Del Sorbo, Pino Persiano:
The Design and Implementation of a Transparent Cryptographic File System for UNIX. USENIX ATC, FREENIX Track 2001: 199-212 - [c34]Ioannis Caragiannis, Afonso Ferreira, Christos Kaklamanis, Stephane Perennes, Pino Persiano, Hervé Rivano:
Approximate Constrained Bipartite Edge Coloring. WG 2001: 21-31 - 2000
- [j20]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Symmetric Communication in All-Optical Tree Networks. Parallel Process. Lett. 10(4): 305-314 (2000) - [c33]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Randomized path coloring on binary trees. APPROX 2000: 60-71 - [c32]Pino Persiano, Ivan Visconti:
User privacy issues regarding certificates and the TLS protocol: the design and implementation of the SPSL protocol. CCS 2000: 53-62 - [c31]Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano:
Efficient Automatic Simulation of Parallel Computation on Network of Workstations. ICALP Satellite Workshops 2000: 191-202 - [c30]Alfredo De Santis
Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations. ICALP 2000: 451-462
1990 – 1999
- 1999
- [j19]Vincenzo Auletta, Angelo Monti, Mimmo Parente, Pino Persiano:
A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees. Algorithmica 23(3): 223-245 (1999) - [j18]Carlo Blundo, Alfredo De Santis
Randomness Complexity of Private Computation. Comput. Complex. 8(2): 145-168 (1999) - [j17]Alfredo De Santis
The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. Inf. Process. Lett. 69(4): 201-206 (1999) - [j16]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Milena Mihail, Pino Persiano:
Optimal Wavelength Routing on Directed Fiber Trees. Theor. Comput. Sci. 221(1-2): 119-137 (1999) - [c29]Alfredo De Santis
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. ICALP 1999: 271-280 - [c28]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Edge Coloring of Bipartite Graphs with Constraints. MFCS 1999: 376-386 - [c27]Carlo Blundo, Clemente Galdi, Pino Persiano:
Randomness Recycling in Constant-Round Private Computations (extended Abstract). DISC 1999: 138-150 - 1998
- [j15]Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
Placing Resources on a Growing Line. J. Algorithms 26(1): 87-100 (1998) - [c26]Alfredo De Santis
Communication-Efficient Anonymous Group Identification. CCS 1998: 73-82 - [c25]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano:
Efficient wavelength routing in trees with low-degree converters. Multichannel Optical Networks: Theory and Practice 1998: 1-14 - [c24]Alfredo De Santis
Image Density is Complete for Non-Interactive-SZK (Extended Abstract). ICALP 1998: 784-795 - [c23]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
On the Complexity of Wavelength Converters. MFCS 1998: 771-779 - [c22]Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Wavelength Routing of Symmetric Communication Requests in Directed Fiber Trees. SIROCCO 1998: 10-19 - [i2]Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano:
The Graph Clustering Problem has a Perfect Zero-Knowledge Proof. IACR Cryptol. ePrint Arch. 1998: 2 (1998) - 1997
- [j14]Alfredo De Santis, Giuseppe Persiano:
Guest editorial. Eur. Trans. Telecommun. 8(5): 443 (1997) - [c21]Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano:
An optimal greedy algorithm for wavelength allocation in directed tree networks. Network Design: Connectivity and Facilities Location 1997: 117-129 - [c20]Christos Kaklamanis, Pino Persiano, Thomas Erlebach, Klaus Jansen:
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing. ICALP 1997: 493-504 - [c19]Alfredo De Santis
Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). ICALP 1997: 716-726 - [c18]Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano:
Bandwidth Allocation Algorithms on Tree-Shaped All-Optical Networks with Wavelength Converters. SIROCCO 1997: 24-39 - 1996
- [j13]Roberto De Prisco
A Note on the Expected Path Length of Trees with Known Fringe. Inf. Process. Lett. 59(6): 309-315 (1996) - [j12]Alfredo De Santis, Giuseppe Persiano:
The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge. J. Cryptol. 9(3): 129-148 (1996) - [j11]Vincenzo Auletta
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree. Theor. Comput. Sci. 165(2): 441-461 (1996) - [c17]Christos Kaklamanis, Giuseppe Persiano:
Efficient Wavelength Routing on Directed Fiber Trees. ESA 1996: 460-470 - [c16]Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles. ESA 1996: 529-545 - [c15]Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano:
A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. SWAT 1996: 259-270 - 1995
- [j10]Alfredo De Santis
Zero-Knowledge Arguments and Public-Key Cryptography. Inf. Comput. 121(1): 23-40 (1995) - [j9]Roberto De Prisco, Giuseppe Persiano:
Characteristic Inequalities for Binary Trees. Inf. Process. Lett. 53(4): 201-207 (1995) - [j8]Roberto De Prisco
Minimal Path Length of Trees with Known Fringe. Theor. Comput. Sci. 143(1): 175-188 (1995) - [c14]Carlo Blundo, Alfredo De Santis
On the Number of Random Bits in Totally Private Computation. ICALP 1995: 171-182 - [c13]Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
Placing Resources in a Tree: Dynamic and Static Algorithms. ICALP 1995: 232-243 - 1994
- [j7]Giovanni Di Crescenzo, Giuseppe Persiano:
Round-Optimal Perfect Zero-Knowledge Proofs. Inf. Process. Lett. 50(2): 93-99 (1994) - [j6]Christos Kaklamanis, Giuseppe Persiano:
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. Math. Syst. Theory 27(5): 471-489 (1994) - [j5]Giuseppe Persiano:
An Optimal Algorithm for the Dining Philosophers Problem. Parallel Process. Lett. 4: 181-187 (1994) - [j4]Alfredo De Santis
Tight Upper and Lower Bounds on the Path Length of Binary Trees. SIAM J. Comput. 23(1): 12-23 (1994) - [j3]Alfredo De Santis
The Knowledge Complexity of Quadratic Residuosity Languages. Theor. Comput. Sci. 132(2): 291-317 (1994) - [j2]Renato M. Capocelli, Alfredo De Santis
Binary prefix codes ending in a "1". IEEE Trans. Inf. Theory 40(4): 1296-1302 (1994) - [c12]Alfredo De Santis, Tatsuaki Okamoto, Giuseppe Persiano:
Zero-Knowledge Proofs of Computational Power in the Shared String Model. ASIACRYPT 1994: 182-192 - [c11]Alfredo De Santis
On Monotone Formula Closure of SZK. FOCS 1994: 454-465 - 1993
- [c10]Alfredo De Santis
Secret Sharing and Perfect Zero Knowledge. CRYPTO 1993: 73-84 - 1992
- [c9]Alfredo De Santis
Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract). FOCS 1992: 427-436 - [c8]Alfredo De Santis
One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. ICALP 1992: 28-40 - [c7]Christos Kaklamanis, Giuseppe Persiano:
Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. SPAA 1992: 118-126 - [c6]Alfredo De Santis
Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash). STACS 1992: 449-460 - 1991
- [j1]Manuel Blum, Alfredo De Santis
Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991) - [c5]Alfredo De Santis, Giuseppe Persiano:
An Optimal Algorithm for the Construction of Optimal Prefix Codes with Given Fringe. Data Compression Conference 1991: 297-306 - [c4]Alfredo De Santis
Tight Bounds on the Path Length of Binary Trees. STACS 1991: 478-487 - 1990
- [c3]Alfredo De Santis
Public-Randomness in Public Key Cryptography. EUROCRYPT 1990: 46-62
1980 – 1989
- 1988
- [c2]Alfredo De Santis
Non-Interactive Zero-Knowledge with Preprocessing. CRYPTO 1988: 269-282 - 1987
- [c1]Alfredo De Santis
Non-Interactive Zero-Knowledge Proof Systems. CRYPTO 1987: 52-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-23 20:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: