Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,504,376 papers from all fields of science
Search
Sign In
Create Free Account
Provable security
Known as:
Provable
, Provably secure
, Security proof
Provable security refers to any type or level of security that can be proved. It is used in different ways by different fields. Usually, this refers…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
36 relations
Adversary (cryptography)
Anti-tamper software
Antivirus software
BB84
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
One-to-many authentication for access control in mobile pay-TV systems
De-biao He
,
Neeraj Kumar
,
Han Shen
,
Jong‐Hyouk Lee
Science China Information Sciences
2016
Corpus ID: 14725824
In traditional authentication schemes for access control in mobile pay-TV systems, one-to-one delivery is used, i.e., one…
Expand
Highly Cited
2012
Highly Cited
2012
Minimum-energy connected coverage in wireless sensor networks with omni-directional and directional features
K. Han
,
Liu Xiang
,
Jun Luo
,
Yang Liu
ACM Interational Symposium on Mobile Ad Hoc…
2012
Corpus ID: 5648533
Wireless Sensor Networks (WSNs) have acquired new features recently, i.e., both the sensor and the antenna of a node can be…
Expand
2012
2012
Integrity Verification of Multiple Data Copies over Untrusted Cloud Servers
Ayad F. Barsoum
,
M. Hasan
IEEE/ACM International Symposium on Cluster…
2012
Corpus ID: 13246323
For an increased level of scalability, availability and durability, some customers may want their data to be replicated on…
Expand
Highly Cited
2012
Highly Cited
2012
Enclosures for the solution set of parametric interval linear systems
M. Hladík
International Journal of Applied Mathematics and…
2012
Corpus ID: 12492781
Abstract We investigate parametric interval linear systems of equations. The main result is a generalization of the Bauer–Skeel…
Expand
Highly Cited
2010
Highly Cited
2010
Distributed Algorithms for Approximating Wireless Network Capacity
M. Dinitz
Proceedings IEEE INFOCOM
2010
Corpus ID: 11366805
In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol…
Expand
Highly Cited
2009
Highly Cited
2009
On the (In)Security and (Im)Practicality of Outsourcing Precise Association Rule Mining
Ian Molloy
,
Ninghui Li
,
Tiancheng Li
Ninth IEEE International Conference on Data…
2009
Corpus ID: 16963510
The recent interest in outsourcing IT services onto the cloud raises two main concerns: security and cost. One task that could be…
Expand
Highly Cited
2009
Highly Cited
2009
Sum-Rate Maximization for Two-Way MIMO Amplify-and-Forward Relaying Systems
Kyoung-Jae Lee
,
Kwangwon Lee
,
Hakjea Sung
,
Inkyu Lee
IEEE Vehicular Technology Conference
2009
Corpus ID: 14224634
This paper considers two-way relaying systems with a multiple-input multiple-output (MIMO) relay between two MIMO terminal nodes…
Expand
2005
2005
How to Get 3-D for the Price of 2-D—Topology and Consistency of 3-D Urban GIS
G. Gröger
,
L. Plümer
GeoInformatica
2005
Corpus ID: 36081075
This article deals with topological concepts and models which are necessary to represent three-dimensional urban objects in a…
Expand
Highly Cited
2004
Highly Cited
2004
On unequal error protection LDPC codes based on Plotkin-type constructions
Vidya Kumar
,
O. Milenkovic
IEEE Global Telecommunications Conference…
2004
Corpus ID: 6848217
A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is…
Expand
1994
1994
Provable strategies for vision-guided exploration in three dimensions
Kiriakos N. Kutulakos
,
C. Dyer
,
V. Lumelsky
Proceedings of the IEEE International Conference…
1994
Corpus ID: 7319628
An approach is presented for exploring an unknown, arbitrary surface in three-dimensional (3D) space by a mobile robot. The main…
Expand
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)
ACCEPT & CONTINUE