Skip to search formSkip to main contentSkip to account menu

Semantic security

Known as: Semantically secure, Semantically-secure 
In cryptography, a cryptosystem is semantically secure if any probabilistic, polynomial-time algorithm (PPTA) that is given the ciphertext of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations
Analysis of algorithmsAuthenticated encryptionAveraging argumentBlock cipher

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Lattice-based identity-based resplittable threshold public key encryption scheme
Threshold public key encryption is a cryptographic primitive where a secret key of an organization is distributed among special… 
2011
2011
Secure transcoding for compressive multimedia sensing
Compressive sensing (CS) has recently attracted much attention due to its unique feature of directly and simultaneously acquiring… 
2010
2010
Towards Trustworthy Identity and Access Management for the Future Internet
The Future Internet, in its different variants, promises a global connectivity of people, things and services.However, in order… 
2010
2010
Receipt-Free K-out-of-L Voting Based on ElGamal Encryption
  • M. Hirt
  • Towards Trustworthy Elections
  • 2010
  • Corpus ID: 11356854
We present a K-out-of-L voting scheme, i.e., a voting scheme that allows every voter to vote for (up to) K candidates from a set… 
2007
2007
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption… 
2007
2007
Supporting creative product/commercial design with computer-based image retrieval
Motivation -- The task of creative product/commercial design can be supported by the retrieval of inspirational images from… 
2006
2006
Secure Cross-Realm C2C-PAKE Protocol
Client-to-client password authenticated key exchange (C2C-PAKE) protocol deals with the authenticated key exchange process… 
2004
2004
Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash
The object of this paper is the concrete security of recent multivariate signature schemes. A major challenge is to reconcile… 
2001
2001
Private Information Retrieval Based on the Subgroup Membership Problem
Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the… 
2001
2001
The emergence of texture: An analysis of the functions of the nominal demonstratives in an English interlanguage corpus
This study uses the concept of "emergent texture" to analyze the corpus behavior of the four nominal demonstratives -- this, that… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)