On testing cache-coherent shared memories
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Designing programs that check their work
Journal of the ACM (JACM)
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Witness-based cryptographic program checking and robust function sharing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Techniques for trusted software engineering
Proceedings of the 20th international conference on Software engineering
The invasiveness of off-line memory checking
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Stack and Queue Integrity on Hostile Platforms
IEEE Transactions on Software Engineering
Certification of Computational Results
IEEE Transactions on Computers
Self-Testing/Correcting Protocols (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Codes for Interactive Authentication
CRYPTO '93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology
How to Manage Persistent State in DRM Systems
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
Caches and Hash Trees for Efficient Memory Integrity Verification
HPCA '03 Proceedings of the 9th International Symposium on High-Performance Computer Architecture
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Efficient Memory Integrity Verification and Encryption for Secure Processors
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
Searchable symmetric encryption: improved definitions and efficient constructions
Proceedings of the 13th ACM conference on Computer and communications security
How to build a trusted database system on untrusted storage
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
GnatDb: a small-footprint, secure database system
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Provable data possession at untrusted stores
Proceedings of the 14th ACM conference on Computer and communications security
Athos: Efficient Authentication of Outsourced File Systems
ISC '08 Proceedings of the 11th international conference on Information Security
Proceedings of the 15th ACM conference on Computer and communications security
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
Scalable and efficient provable data possession
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Remote Integrity Check with Dishonest Storage Server
ESORICS '08 Proceedings of the 13th European Symposium on Research in Computer Security: Computer Security
Hardware Mechanisms for Memory Authentication: A Survey of Existing Techniques and Engines
Transactions on Computational Science IV
MAC Precomputation with Applications to Secure Memory
ISC '09 Proceedings of the 12th International Conference on Information Security
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
Incremental cryptography and memory checkers
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Optimal resilient dynamic dictionaries
ESA'07 Proceedings of the 15th annual European conference on Algorithms
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
Streaming graph computations with a helpful advisor
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Designing reliable algorithms in unreliable memories
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An efficient way to build secure disk
ISPEC'06 Proceedings of the Second international conference on Information Security Practice and Experience
Protecting mass data basing on small trusted agent
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Resilient algorithms and data structures
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Designing reliable algorithms in unreliable memories
Computer Science Review
A cost-effective tag design for memory data authentication in embedded systems
Proceedings of the 2012 international conference on Compilers, architectures and synthesis for embedded systems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Recursive composition and bootstrapping for SNARKS and proof-carrying data
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
Verifying computations with state
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Searchable symmetric encryption: Improved definitions and efficient constructions
Journal of Computer Security
| Hi-index | 0.00 |
The notion of program checking is extended to include programs that alter their environment, in particular, programs that store and retrieve data from memory. The model considered allows the checker a small amount of reliable memory. The checker is presented with a sequence of requests (online) to a data structure which must reside in a large but unreliable memory. The data structure is viewed as being controlled by an adversary. The checker is to perform each operation in the input sequence using its reliable memory and the unreliable data structure so that any error in the operation of the structure will be detected by the checker with high probability. Checkers for various data structures are presented. Lower bounds of log n on the amount of reliable memory needed by these checkers, where n is the size of the structure, are proved.