Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,229,799 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
16 relations
Adversary (cryptography)
Algorithm
Computational indistinguishability
Computational problem
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Nearly Quadratic Broadcast Without Trusted Setup Under Dishonest Majority
Georgios Tsimos
,
J. Loss
,
C. Papamanthou
IACR Cryptology ePrint Archive
2020
Corpus ID: 220794804
,
2017
2017
A Robust and Efficient Three-Factor Authentication and Session Key Agreement Mechanism for SIP
Sk Hafizul Islam
,
Varun Rajeev
,
Ruhul Amin
Second International Conference on Recent Trends…
2017
Corpus ID: 41453162
Session Initiation Protocol (SIP), which is an IP based telephony protocol, is used mainly for the purpose of starting…
Expand
2015
2015
Model To Prevent Websites From XSS Vulnerabilities
Tejinder Singh Mehta
,
Sanjay Jamwal
2015
Corpus ID: 14586488
As social websites get more and more users across internet, Cross Site Scripting is becoming one of the major problems, which…
Expand
2014
2014
Securing IPv6's Neighbour and Router Discovery, using Locally Authentication Process
Simanta P Sarma
2014
Corpus ID: 62658951
Internet Protocol version six (IPv6), the next generation Internet Protocol (IP), exists sparsely in today's world.Internet…
Expand
2014
2014
Intrusion Detection, Secure Protocol & Network Creation for Spontaneous Wireless AD HOC Network
Nikhil Varghane
,
Prof. Bhakti Kurade
,
P. Pote
2014
Corpus ID: 212611924
— Fundamental aspect in wireless network creation & wireless communication is use of security so this paper proposing a secure…
Expand
2013
2013
A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
M. R. K. Ariffin
,
M. Asbullah
,
N. Abu
,
Z. Mahad
2013
Corpus ID: 265095965
In this paper, we introduce a new scheme based on the hardness of factoring integers of the shape ��=�� 2 �� . Our scheme uses a…
Expand
2013
2013
Essential lack of security proof in quantum key distribution
H. Yuen
2013
Corpus ID: 117853749
All the currently available unconditional security proofs on quantum key distribution, in particular for the BB84 protocol and…
Expand
2012
2012
Computationally Sound Verification of the NSL Protocol via Computationally Complete Symbolic Attacker
Gergei Bana
,
P. Adão
,
Hideki Sakurada
IACR Cryptology ePrint Archive
2012
Corpus ID: 15717310
In this paper we show that the recent technique of computationally complete symbolic attackers proposed by Bana and Comon-Lundh…
Expand
2012
2012
A New Efficient Asymmetric Cryptosystem Based on the Integer Factorization Problem
M. R. K. Ariffin
2012
Corpus ID: 16829106
A new asymmetric cryptosystem based on the Integer Factorization Problem is proposed. It posses an encryption and decryption…
Expand
2007
2007
Zur Lösung von zahlentheoretischen Problemen mit klassischen und Quantencomputern
A. Schmidt
2007
Corpus ID: 39177971
In dieser Arbeit werden Algorithmen zur Losung zahlentheoretischer Probleme fur klassische Computer und Quantencomputer…
Expand