Giovanni Di Crescenzo


Ontology type: schema:Person     


Person Info

NAME

Giovanni

SURNAME

Di Crescenzo

Publications in SciGraph latest 50 shown

  • 2018-10-26 Cryptographic Password Obfuscation in INFORMATION AND COMMUNICATIONS SECURITY
  • 2018-10-18 Cryptographic Program Obfuscation: Practical Solutions and Application-Driven Models in VERSATILE CYBERSECURITY
  • 2018-07-14 Efficient and Secure Delegation to a Single Malicious Server: Exponentiation over Non-abelian Groups in MATHEMATICAL SOFTWARE – ICMS 2018
  • 2017 Privacy-Preserving Deterministic Automata Evaluation with Encrypted Data Blocks in DATA PRIVACY MANAGEMENT, CRYPTOCURRENCIES AND BLOCKCHAIN TECHNOLOGY
  • 2016 Enhanced Functionality and Confidentiality for Database Search and Publish/Subscribe Protocols in DATA AND APPLICATIONS SECURITY AND PRIVACY XXX
  • 2015 Privacy-Preserving Range Queries from Keyword Queries in DATA AND APPLICATIONS SECURITY AND PRIVACY XXIX
  • 2015 Foundations of Optical Encryption: A Candidate Short-Key Scheme in NETWORK AND SYSTEM SECURITY
  • 2015 Efficient Computations over Encrypted Data Blocks in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015
  • 2015 Efficient and Secure Delegation of Group Exponentiation to a Single Server in RADIO FREQUENCY IDENTIFICATION. SECURITY AND PRIVACY ISSUES
  • 2014 Privacy-Preserving Publish/Subscribe: Efficient Protocols in a Distributed Model in DATA PRIVACY MANAGEMENT AND AUTONOMOUS SPONTANEOUS SECURITY
  • 2014 On Minimizing the Size of Encrypted Databases in DATA AND APPLICATIONS SECURITY AND PRIVACY XXVIII
  • 2014 Practical and Privacy-Preserving Policy Compliance for Outsourced Data in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2014 Practical Private Information Retrieval from a Time-Varying, Multi-attribute, and Multiple-Occurrence Database in DATA AND APPLICATIONS SECURITY AND PRIVACY XXVIII
  • 2013 Efficient and Private Three-Party Publish/Subscribe in NETWORK AND SYSTEM SECURITY
  • 2012 Data Forensics Constructions from Cryptographic Hashing and Coding in DIGITAL FORENSICS AND WATERMARKING
  • 2012 Zero-Knowledge Proofs via Polynomial Representations in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012
  • 2011 Combinatorial Group Testing for Corruption Localizing Hashing in COMPUTING AND COMBINATORICS
  • 2010-12 On server trust in private proxy auctions in ELECTRONIC COMMERCE RESEARCH
  • 2009 Foundations of Optical Encryption: Formal Modeling and Achieving Shannon Secrecy in UNCONVENTIONAL COMPUTATION
  • 2009 Social Network Privacy via Evolving Access Control in WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS
  • 2009 Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model in COMPUTING AND COMBINATORICS
  • 2009 Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model in COMPUTER SCIENCE - THEORY AND APPLICATIONS
  • 2009 Corruption-Localizing Hashing in COMPUTER SECURITY – ESORICS 2009
  • 2008 On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries in MATHEMATICAL METHODS IN COMPUTER SCIENCE
  • 2008 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge in ALGORITHMS AND COMPUTATION
  • 2008 Succinct NP Proofs from an Extractability Assumption in LOGIC AND THEORY OF ALGORITHMS
  • 2007 Public Key Encryption with Searchable Keywords Based on Jacobi Symbols in PROGRESS IN CRYPTOLOGY – INDOCRYPT 2007
  • 2006-05-17 Keeping the SZK-verifier honest unconditionally in ADVANCES IN CRYPTOLOGY — CRYPTO '97
  • 2006 Perfectly Secure Password Protocols in the Bounded Retrieval Model in THEORY OF CRYPTOGRAPHY
  • 2005-06-20 Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols in STACS 98
  • 2005 Concurrent Zero Knowledge in the Public-Key Model in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 Threshold Cryptography in Mobile Ad Hoc Networks in SECURITY IN COMMUNICATION NETWORKS
  • 2005 Asynchronous Perfectly Secure Communication over One-Time Pads in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2005 Towards a Theory of Intrusion Detection in COMPUTER SECURITY – ESORICS 2005
  • 2005 Approximate Message Authentication and Biometric Entity Authentication in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2005 You Can Prove So Many Things in Zero-Knowledge in INFORMATION SECURITY AND CRYPTOLOGY
  • 2004 On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004
  • 2004 Reducing Server Trust in Private Proxy Auctions in TRUST AND PRIVACY IN DIGITAL BUSINESS
  • 2004 Public Key Encryption with Keyword Search in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004
  • 2004 Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model in ADVANCES IN CRYPTOLOGY – CRYPTO 2004
  • 2004 Improved Setup Assumptions for 3-Round Resettable Zero Knowledge in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2004
  • 2003 Efficient Re-keying Protocols for Multicast Encryption in SECURITY IN COMMUNICATION NETWORKS
  • 2003 Hypergraph Decomposition and Secret Sharing in ALGORITHMS AND COMPUTATION
  • 2003 Equivocable and Extractable Commitment Schemes in SECURITY IN COMMUNICATION NETWORKS
  • 2002-08-23 Randomness-Optimal Characterization of Two NP Proof Systems in RANDOMIZATION AND APPROXIMATION TECHNIQUES IN COMPUTER SCIENCE
  • 2002-04-12 How To Forget a Secret in STACS 99
  • 2002-02-18 Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002-01-18 Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2002 Privacy for the Stock Market in FINANCIAL CRYPTOGRAPHY
  • 2001-09-05 Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the Max Improvement Ratio in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001
  • Affiliations

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.432790.b", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Di Crescenzo", 
        "givenName": "Giovanni", 
        "id": "sg:person.010106610565.51", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010106610565.51"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:05", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1851.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010106610565.51'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010106610565.51'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010106610565.51'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010106610565.51'


     




    Preview window. Press ESC to close (or click here)


    ...