Ueli M Maurer


Ontology type: schema:Person     


Person Info

NAME

Ueli M

SURNAME

Maurer

Publications in SciGraph latest 50 shown

  • 2021-12-01 Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework) in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2021
  • 2021-11-04 Generalized Proofs of Knowledge with Fully Dynamic Setup in THEORY OF CRYPTOGRAPHY
  • 2021-11-04 Direct Product Hardness Amplification in THEORY OF CRYPTOGRAPHY
  • 2021-11-04 Adaptive Security of Multi-party Protocols, Revisited in THEORY OF CRYPTOGRAPHY
  • 2021-05-01 Revisiting (R)CCA Security and Replay Protection in PUBLIC-KEY CRYPTOGRAPHY – PKC 2021
  • 2020-12-09 Synchronous Constructive Cryptography in THEORY OF CRYPTOGRAPHY
  • 2020-12-09 Coupling of Random Systems in THEORY OF CRYPTOGRAPHY
  • 2020-12-05 MPC with Synchronous Security and Asynchronous Responsiveness in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2020
  • 2020-09-07 Anonymous Symmetric-Key Communication in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2020-08-10 Overcoming Impossibility Results in Composable Security Using Interval-Wise Guarantees in ADVANCES IN CRYPTOLOGY – CRYPTO 2020
  • 2020-08-04 Non-malleable Encryption: Simpler, Shorter, Stronger in JOURNAL OF CRYPTOLOGY
  • 2020-04-29 Topology-Hiding Computation for Networks with Unknown Delays in PUBLIC-KEY CRYPTOGRAPHY – PKC 2020
  • 2019-11-22 A Unified and Composable Take on Ratcheting in THEORY OF CRYPTOGRAPHY
  • 2019-11-22 Composable and Finite Computational Security of Quantum Message Transmission in THEORY OF CRYPTOGRAPHY
  • 2019-04-18 Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2019
  • 2018-11-08 Topology-Hiding Computation Beyond Semi-Honest Adversaries in THEORY OF CRYPTOGRAPHY
  • 2018-11-04 Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio in THEORY OF CRYPTOGRAPHY
  • 2018-08-03 Security Definitions for Hash Functions: Combining UCE and Indifferentiability in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-08-03 A Constructive Perspective on Signcryption Security in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2018-03-31 But Why Does It Work? A Rational Protocol Design Treatment of Bitcoin in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2018
  • 2018-03-21 Erratum to: Per-Session Security: Password-Based Cryptography Revisited in COMPUTER SECURITY – ESORICS 2017
  • 2018-03-07 Composable and Robust Outsourced Storage in TOPICS IN CRYPTOLOGY – CT-RSA 2018
  • 2018-03-01 On Composable Security for Digital Signatures in PUBLIC-KEY CRYPTOGRAPHY – PKC 2018
  • 2017-11-30 Strengthening Access Control Encryption in ADVANCES IN CRYPTOLOGY – ASIACRYPT 2017
  • 2017-08-12 Per-Session Security: Password-Based Cryptography Revisited in COMPUTER SECURITY – ESORICS 2017
  • 2017-07-29 Bitcoin as a Transaction Ledger: A Composable Treatment in ADVANCES IN CRYPTOLOGY – CRYPTO 2017
  • 2016-10-22 From Indifferentiability to Constructive Cryptography (and Back) in THEORY OF CRYPTOGRAPHY
  • 2016-08-11 Memory Erasability Amplification in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2016-07-21 Network-Hiding Communication and Applications to Multi-party Protocols in ADVANCES IN CRYPTOLOGY – CRYPTO 2016
  • 2016-04-27 Quantum technology: from research to application in APPLIED PHYSICS B
  • 2015-12-08 Robust Authenticated Encryption and the Limits of Symmetric Cryptography in CRYPTOGRAPHY AND CODING
  • 2015-11-28 Augmented Secure Channels and the Goal of the TLS 1.3 Record Layer in PROVABLE SECURITY
  • 2015-11-28 (De-)Constructing TLS 1.3 in PROGRESS IN CRYPTOLOGY -- INDOCRYPT 2015
  • 2015-06-03 Zero-knowledge proofs of knowledge for group homomorphisms in DESIGNS, CODES AND CRYPTOGRAPHY
  • 2015-03-29 Anonymous Authentication with Shared Secrets in PROGRESS IN CRYPTOLOGY - LATINCRYPT 2014
  • 2015 From Single-Bit to Multi-bit Public-Key Encryption via Non-malleable Codes in THEORY OF CRYPTOGRAPHY
  • 2015 Idealizing Identity-Based Encryption in ADVANCES IN CRYPTOLOGY -- ASIACRYPT 2015
  • 2015 Query-Complexity Amplification for Random Oracles in INFORMATION THEORETIC SECURITY
  • 2014 Key-Indistinguishable Message Authentication Codes in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2014 Broadcast Amplification in THEORY OF CRYPTOGRAPHY
  • 2013 Universally Composable Synchronous Computation in THEORY OF CRYPTOGRAPHY
  • 2013 A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2013 A Constructive Perspective on Key Encapsulation in
  • 2013 Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited in ADVANCES IN CRYPTOLOGY - ASIACRYPT 2013
  • 2013 Anonymity-Preserving Public-Key Encryption: A Constructive Approach in PRIVACY ENHANCING TECHNOLOGIES
  • 2013 Resource-Restricted Indifferentiability in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2013
  • 2013 Erratum: A Dynamic Tradeoff between Active and Passive Corruptions in Secure Multi-Party Computation in ADVANCES IN CRYPTOLOGY – CRYPTO 2013
  • 2012 Constructive Cryptography – A New Paradigm for Security Definitions and Proofs in THEORY OF SECURITY AND APPLICATIONS
  • 2012 Collusion-Preserving Computation in ADVANCES IN CRYPTOLOGY – CRYPTO 2012
  • 2012 Confidentiality and Integrity: A Constructive Perspective in THEORY OF CRYPTOGRAPHY
  • 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": "http://www.grid.ac/institutes/grid.5801.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.425888.b", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.16750.35", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.208504.b", 
            "type": "Organization"
          }
        ], 
        "familyName": "Maurer", 
        "givenName": "Ueli M", 
        "id": "sg:person.01316567627.91", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01316567627.91"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-01-01T19:56", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/person/person_701.jsonl", 
        "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.01316567627.91'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...