The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Giuseppe Persiano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti
    Improved Setup Assumptions for 3-Round Resettable Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:530-544 [Conf]
  2. Alfredo De Santis, Tatsuaki Okamoto, Giuseppe Persiano
    Zero-Knowledge Proofs of Computational Power in the Shared String Model. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1994, pp:182-192 [Conf]
  3. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Communication-Efficient Anonymous Group Identification. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 1998, pp:73-82 [Conf]
  4. Joël Alwen, Giuseppe Persiano, Ivan Visconti
    Impossibility and Feasibility Results for Zero Knowledge with Public Keys. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2005, pp:135-151 [Conf]
  5. Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Visconti
    Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2004, pp:237-253 [Conf]
  6. Alfredo De Santis, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano, Amit Sahai
    Robust Non-interactive Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2001, pp:566-598 [Conf]
  7. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Secret Sharing and Perfect Zero Knowledge. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:73-84 [Conf]
  8. Alfredo De Santis, Silvio Micali, Giuseppe Persiano
    Non-Interactive Zero-Knowledge Proof Systems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1987, pp:52-72 [Conf]
  9. Alfredo De Santis, Silvio Micali, Giuseppe Persiano
    Non-Interactive Zero-Knowledge with Preprocessing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:269-282 [Conf]
  10. Alfredo De Santis, Giuseppe Persiano
    An Optimal Algorithm for the Construction of Optimal Prefix Codes with Given Fringe. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:297-306 [Conf]
  11. Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
    A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:529-545 [Conf]
  12. Christos Kaklamanis, Giuseppe Persiano
    Efficient Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:460-470 [Conf]
  13. Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, Giuseppe Persiano
    Public Key Encryption with Keyword Search. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2004, pp:506-522 [Conf]
  14. Alfredo De Santis, Giuseppe Persiano
    Public-Randomness in Public Key Cryptography. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:46-62 [Conf]
  15. Giuseppe Persiano, Ivan Visconti
    An Efficient and Usable Multi-show Non-transferable Anonymous Credential System. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:196-211 [Conf]
  16. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung
    On Monotone Formula Closure of SZK [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:454-465 [Conf]
  17. Alfredo De Santis, Giuseppe Persiano
    Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:427-436 [Conf]
  18. Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
    Placing Resources in a Tree: Dynamic and Static Algorithms. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:232-243 [Conf]
  19. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    The Power of Verification for One-Parameter Agents. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:171-182 [Conf]
  20. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre
    New Constructions of Mechanisms with Verification. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:596-607 [Conf]
  21. Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
    On the Number of Random Bits in Totally Private Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:171-182 [Conf]
  22. Giuseppe Persiano, Ivan Visconti
    Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:228-240 [Conf]
  23. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:451-462 [Conf]
  24. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:716-726 [Conf]
  25. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:271-280 [Conf]
  26. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung
    Image Density is Complete for Non-Interactive-SZK (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:784-795 [Conf]
  27. Alfredo De Santis, Giuseppe Persiano, Moti Yung
    One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:28-40 [Conf]
  28. Giuseppe Cattaneo, Pompeo Faruolo, Umberto Ferraro Petrillo, Giuseppe Persiano
    Providing Privacy for Web Services by Anonymous Group Identification. [Citation Graph (0, 0)][DBLP]
    ICWS, 2004, pp:166-173 [Conf]
  29. Giuseppe Persiano, Ivan Visconti
    On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:753-764 [Conf]
  30. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:356-367 [Conf]
  31. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Randomness-Optimal Characterization of Two NP Proof Systems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:179-193 [Conf]
  32. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    On Designing Truthful Mechanisms for Online Scheduling. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:3-17 [Conf]
  33. Christos Kaklamanis, Giuseppe Persiano
    Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:118-126 [Conf]
  34. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
    Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:608-619 [Conf]
  35. Alfredo De Santis, Giuseppe Persiano
    Tight Bounds on the Path Length of Binary Trees. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:478-487 [Conf]
  36. Alfredo De Santis, Giuseppe Persiano
    Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash). [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:449-460 [Conf]
  37. Vincenzo Auletta, Angelo Monti, Domenico Parente, Giuseppe Persiano
    A Linear Time Algorithm for the Feasibility of Pebble Motion on Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:259-270 [Conf]
  38. Marios Mavronicolas, Vicky G. Papadopoulou, Giuseppe Persiano, Anna Philippou, Paul G. Spirakis
    The Price of Defense and Fractional Matchings. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:115-126 [Conf]
  39. Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
    Wavelength Routing in All-optical Tree Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2001, v:20, n:2, pp:- [Journal]
  40. Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro
    Randomness Complexity of Private Computation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:2, pp:145-168 [Journal]
  41. Christos Kaklamanis, Danny Krizanc, Manuela Montangero, Giuseppe Persiano
    Efficient automatic simulation of parallel computation on networks of workstations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:10, pp:1500-1509 [Journal]
  42. Ioannis Caragiannis, Christos Kaklamanis, Giuseppe Persiano
    Wavelength Routing in All-Optical Tree Networks: A Survey. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:76, n:, pp:104-124 [Journal]
  43. Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano
    The Graph Clustering Problem has a Perfect Zero-Knowledge Proof [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:6, pp:- [Journal]
  44. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    Zero-Knowledge Arguments and Public-Key Cryptography [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:121, n:1, pp:23-40 [Journal]
  45. Carlo Blundo, Clemente Galdi, Giuseppe Persiano
    Low-randomness constant-round private XOR computations. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2007, v:6, n:1, pp:15-26 [Journal]
  46. Giovanni Di Crescenzo, Giuseppe Persiano
    Round-Optimal Perfect Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:2, pp:93-99 [Journal]
  47. Roberto De Prisco, Giuseppe Persiano
    Characteristic Inequalities for Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:4, pp:201-207 [Journal]
  48. Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano
    A Note on the Expected Path Length of Trees with Known Fringe. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:309-315 [Journal]
  49. Alfredo De Santis, Giovanni Di Crescenzo, Oded Goldreich, Giuseppe Persiano
    The Graph Clustering Problem has a Perfect Zero-Knowledge Interactive Proof. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:4, pp:201-206 [Journal]
  50. Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
    Placing Resources on a Growing Line. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:26, n:1, pp:87-100 [Journal]
  51. Alfredo De Santis, Giuseppe Persiano
    The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:3, pp:129-148 [Journal]
  52. Christos Kaklamanis, Giuseppe Persiano
    Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of Processors. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:5, pp:471-489 [Journal]
  53. Clemente Galdi, Christos Kaklamanis, Manuela Montangero, Giuseppe Persiano
    Station Placement in Networks. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2005, v:15, n:1-2, pp:117-130 [Journal]
  54. Giuseppe Persiano
    An Optimal Algorithm for the Dining Philosophers Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:181-187 [Journal]
  55. Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano
    Noninteractive Zero-Knowledge. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:6, pp:1084-1118 [Journal]
  56. Alfredo De Santis, Giuseppe Persiano
    Tight Upper and Lower Bounds on the Path Length of Binary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:12-23 [Journal]
  57. Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
    Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:165, n:2, pp:441-461 [Journal]
  58. Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano
    Minimal Path Length of Trees with Known Fringe. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:175-188 [Journal]
  59. Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
    The Knowledge Complexity of Quadratic Residuosity Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:291-317 [Journal]
  60. Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano
    Binary prefix codes ending in a "1". [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1296-0 [Journal]
  61. Aniello Del Sorbo, Clemente Galdi, Giuseppe Persiano
    Distributed Certified Information Access for Mobile Devices. [Citation Graph (0, 0)][DBLP]
    WISTP, 2007, pp:67-79 [Conf]

  62. Private-Key Hidden Vector Encryption with Key Confidentiality. [Citation Graph (, )][DBLP]


  63. Collusion-Free Multiparty Computation in the Mediated Model. [Citation Graph (, )][DBLP]


  64. Information security for sensors by overwhelming random sequences and permutations. [Citation Graph (, )][DBLP]


  65. Validating Orchestration of Web Services with BPEL and Aggregate Signatures. [Citation Graph (, )][DBLP]


  66. A Distributed Implementation of the Certified Information Access Service. [Citation Graph (, )][DBLP]


  67. Improved Security Notions and Protocols for Non-transferable Identification. [Citation Graph (, )][DBLP]


  68. Untraceable Tags Based on Mild Assumptions. [Citation Graph (, )][DBLP]


  69. Increasing Privacy Threats in the Cyberspace: The Case of Italian E-Passports. [Citation Graph (, )][DBLP]


  70. Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. [Citation Graph (, )][DBLP]


  71. Private Capacities in Mechanism Design. [Citation Graph (, )][DBLP]


  72. Simulation-Based Concurrent Non-malleable Commitments and Decommitments. [Citation Graph (, )][DBLP]


  73. Interference Games in Wireless Networks. [Citation Graph (, )][DBLP]


  74. Hidden-Vector Encryption with Groups of Prime Order. [Citation Graph (, )][DBLP]


  75. Alternatives to Truthfulness Are Hard to Recognize. [Citation Graph (, )][DBLP]


  76. Mixing Time and Stationary Expected Social Welfare of Logit Dynamics [Citation Graph (, )][DBLP]


  77. Concurrent Non-Malleable Witness Indistinguishability and its Applications. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.454secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002