FAQ

Security parameter

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

Topic mentions per year

Topic mentions per year

1969-2017
0204019692017

Related topics

Related topics

16 relations
AdversaryAlgorithmComputational indistinguishabilityComputational problem
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Security parameter
Algorithm
Time complexity
Cryptography
String
Adversary

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Masking against Side-Channel Attacks: A Formal Security Proof
Masking is a well-known countermeasure to protect block cipher implementations against side-channel attacks. The principle is to… (More)
Is this relevant?
2013
2013
Higher-Order Side Channel Security and Mask Refreshing
Masking is a widely used countermeasure to protect block cipher implementations against side-channel attacks. The principle is to… (More)
  • figure 1
  • table 2
  • table 1
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… (More)
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… (More)
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… (More)
Is this relevant?
2008
2008
Adaptive Security in Broadcast Encryption Systems
We present new techniques for achieving adaptive security in broadcast encryption systems. Previous work on fully collusion… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A Computationally Sound Mechanized Prover for Security Protocols
We present a new mechanized prover for secrecy properties of security protocols. In contrast to most previous provers, our tool… (More)
  • figure 1
Is this relevant?
2003
2003
The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
Luby and Rackoff showed how to construct a (super-)pseudorandom permutation {0, 1}2n → {0, 1}2n from some number r of… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
How to Go Beyond the Black-Box Simulation Barrier
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the… (More)
Is this relevant?
1998
1998
Authentication , Enhanced Security and Error Correcting Codes
In electronic communications and in access to systems, the issue of authentication of the Sender S of a message M , as well as of… (More)
Is this relevant?