Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (Q2953784)

From MaRDI portal

Revision as of 06:02, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Towards Tightly Secure Lattice Short Signature and Id-Based Encryption	scientific article

Statements

scholarly article

0 references

Towards Tightly Secure Lattice Short Signature and Id-Based Encryption (English)

0 references

0 references

0 references

Advances in Cryptology – ASIACRYPT 2016

0 references

publication date

6 January 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-53890-6_14

0 references

Tagged One-Time Signatures: Tight Security and Optimal Tag Size

0 references

Efficient Lattice (H)IBE in the Standard Model

0 references

0 references

Short Signatures with Short Public Keys from Homomorphic Trapdoor Functions

0 references

A Framework for Identity-Based Encryption with Almost Tight Security

0 references

Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance

0 references

New and Improved Key-Homomorphic Pseudorandom Functions

0 references

Pseudorandom Functions and Lattices

0 references

Tightly-Secure Signatures from Chameleon Hash Functions

0 references

(Hierarchical) Identity-Based Encryption from Affine Message Authentication

0 references

Practical Signatures from Standard Assumptions

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

0 references

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

0 references

Short signatures from the Weil pairing

0 references

Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More

0 references

Classical hardness of learning with errors

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Lattice-based FHE as secure as PKE

0 references

Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security

0 references

Advances in Cryptology – CRYPTO 2004

0 references

0 references

Bonsai trees, or how to delegate a lattice basis

0 references

Fully, (Almost) Tightly Secure IBE and Dual System Groups

0 references

Efficient Pseudorandom Functions via On-the-Fly Adaptation

0 references

Improved Short Lattice Signatures in the Standard Model

0 references

The Cramer-Shoup Strong-RSA Signature Scheme Revisited

0 references

Secure Hash-and-Sign Signatures Without the Random Oracle

0 references

Practical Identity-Based Encryption Without Random Oracles

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Attribute-based encryption for circuits

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

0 references

0 references

Predicate Encryption for Circuits from LWE

0 references

Riding on Asymmetry: Efficient ABE for Branching Programs

0 references

Tightly Secure Signatures and Public-Key Encryption

0 references

Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting

0 references

Realizing Hash-and-Sign Signatures under Standard Assumptions

0 references

Short and Stateless Signatures from the RSA Assumption

0 references

New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

0 references

Lattice Signatures without Trapdoors

0 references

Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

0 references

Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

0 references

Number-theoretic constructions of efficient pseudo-random functions

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

Efficient Identity-Based Encryption Without Random Oracles

0 references

Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-53890-6_14

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2953784

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2953784&oldid=36299318"