Cryptographic algorithms for privacy-preserving online applications
From MaRDI portal
Publication:2668547
Recommendations
- Survey on homomorphic encryption algorithm and its application in the privacy-preserving for cloud computing
- Homomorphic encryption systems statement: trends and challenges
- Privacy preserving association rules mining based on secure two-party computation
- Cryptographic technology for benefiting from Big Data
- Data and Applications Security XIX
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Asynchronous Multiparty Computation: Theory and Implementation
- Definitions and properties of zero-knowledge proof systems
- Efficient fully homomorphic encryption from (standard) LWE
- Efficient signature generation by smart cards
- Efficient zero-knowledge arguments from two-tiered homomorphic commitments
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- Fully homomorphic encryption over the integers
- Fully homomorphic encryption using ideal lattices
- Fully homomorphic encryption with relatively small key and ciphertext sizes
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to share a secret
- scientific article; zbMATH DE number 1583790 (Why is no real title available?)
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 1024000 (Why is no real title available?)
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- Modeling Bitcoin contracts by timed automata
- Multi-bit Cryptosystems Based on Lattice Problems
- Multiparty Computation from Somewhat Homomorphic Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Perfect Non-interactive Zero Knowledge for NP
- Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Publicly verifiable secret sharing
- Short pairing-based non-interactive zero-knowledge arguments
- The Knowledge Complexity of Interactive Proof Systems
- Verifiable homomorphic secret sharing
Cited in
(3)
This page was built for publication: Cryptographic algorithms for privacy-preserving online applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2668547)
