Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Security parameter

In cryptography, the security parameter is a variable that measures the input size of the computational problem. Both the resource requirements of… Expand
Wikipedia

Related topics

Related topics

16 relations
Adversary (cryptography)AlgorithmComputational indistinguishabilityComputational problem
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Parsimonious skew mixture models for model-based clustering and classification
Robust mixture modeling approaches using skewed distributions have recently been explored to accommodate asymmetric data… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
(Leveled) fully homomorphic encryption without bootstrapping
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Efficient Fully Homomorphic Encryption from (Standard) LWE
We present a fully homomorphic encryption scheme that is based solely on the(standard) learning with errors (LWE) assumption… Expand
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
We introduce and formalize the notion of Verifiable Computation, which enables a computationally weak client to "outsource" the… Expand
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Adaptive Security in Broadcast Encryption Systems (with Short Ciphertexts)
We present new techniques for achieving adaptive security in broadcast encryption systems. Previous work on fully collusion… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Dual RSA and Its Security Analysis
We present new variants of an RSA whose key generation algorithms output two distinct RSA key pairs having the same public and… Expand
  • table I
  • table II
  • table III
  • figure 1
  • table IV
Is this relevant?
Highly Cited
2007
Highly Cited
2007
A Framework for Efficient and Composable Oblivious Transfer
We propose a simple and general framework for constructing oblivious transfer (OT) protocols that are efficient, universally… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Modular Security Proofs for Key Agreement Protocols
The security of key agreement protocols has traditionally been notoriously hard to establish. In this paper we present a modular… Expand
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Chosen-Ciphertext Security from Identity-Based Encryption
We propose a simple and efficient construction of a CCA-secure public-key encryption scheme from any CPA-secure identity-based… Expand
  • table 1
Is this relevant?
1999
1999
Unconditionally Secure Quantum Coin Tossing
In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE