Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

36 relations
Adversary (cryptography)Anti-tamper softwareAntivirus softwareBB84

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Efficient Data Collection in Sensor-Cloud System with Multiple Mobile Sinks
Cloud computing extends the data processing ability and storage ability of wireless sensor networks (WSNs). However, due to the… 
Review
2013
Review
2013
A Framework for Automated Security Proof and its Application to OAEP
OAEP is a widely used public-key encryption scheme based on trapdoor permutation. Its security proof has been scrutinized and… 
2012
2012
Algorithm design for femtocell base station placement in commercial building environments
Although femtocell deployments in residential buildings have been increasingly prevalent, femtocell deployment in commercial… 
2009
2009
Observing the Randomness in RO-Based TRNG
The paper deals with true random number generators using a set of ring oscillators as proposed by Sunar et al. in 2007. The… 
2007
2007
‘ -Invertible Cycles for M ultivariate Q uadratic ( MQ ) Public Key Cryptography
. We propose a new basic trapdoor ‘ IC ( ‘ -Invertible Cycles) of the mixed (cid:28)eld type for M ultivariate Q uadratic public… 
2004
2004
A simple polynomial time framework for reduced-path decomposition in multipath routing
The recent reduction in telecommunications spending has increased the importance of network planning to improve the return on… 
2002
2002
Threshold Ring Signatures for Ad-hoc Groups
In this paper, we investigate the recent paradigm for group signatures proposed by Rivest et al. at Asiacrypt '01. We rst improve… 
1998
1998
A Note on Low Density Parity Check Codes for Erasures and Errors
We analyze low density parity check codes that correct both errors and erasures using a simple decoding scheme. Our framework… 
1992
1992
Modal logic as metalogic
The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the… 
1991
1991
A novel algorithm for discrete-event simulation: asynchronous distributed discrete-event simulation algorithm for cyclic circuits using a dataflow network
Distributed simulation of circuits in which the process interactions form a cyclic graph is addressed. The method described uses…