Deterministic Encryption: Definitional Equivalences and Constructions Without Random Oracles

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-85174-5_20
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Short Signatures Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Short Group Signature Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Perfectly Secure Oblivious RAM Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Proxy Re-Signature Schemes Without Random Oracles

English

Certificate-Based Signature Schemes Without Pairings or Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

On Pseudo-Random Oracles

Tatra Mountains Mathematical Publications
Mathematics
2012English

Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures From Lattices Without Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Combiners for Backdoored Random Oracles

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Solo-Fast Universal Constructions for Deterministic Abortable Objects

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy