Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,481,413 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
2015
2015
Efficient Integrity Auditing for Shared Data in the Cloud with Secure User Revocation
Yuchuan Luo
,
Ming Xu
,
Shaojing Fu
,
Dongsheng Wang
,
Junquan Deng
IEEE Trustcom/BigDataSE/ISPA
2015
Corpus ID: 36950467
With the cloud storage services, users can easily form a group and share data with each other. Given the fact that the cloud is…
Expand
2013
2013
Tight Convex Relaxations for Vector-Valued Labeling
Bastian Goldlücke
,
Evgeny Strekalovskiy
,
D. Cremers
SIAM Journal of Imaging Sciences
2013
Corpus ID: 7167670
Multilabel problems are of fundamental importance in computer vision and image analysis. Yet, finding global minima of the…
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
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
Highly Cited
2002
Highly Cited
2002
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
H. Sherali
,
Intesar Al-Loughani
,
Shivaram Subramanian
Operational Research
2002
Corpus ID: 18332498
In this paper, we study the capacitated Euclidean andlpdistance location-allocation problems. There exists no global optimization…
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