Computational geometry: an introduction
Computational geometry: an introduction
A data structure for dynamic trees
Journal of Computer and System Sciences
Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Maintenance of a minimum spanning forest in a dynamic plane graph
Journal of Algorithms
Checking approximate computations over the reals
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Designing programs that check their work
Journal of the ACM (JACM)
Checking the convexity of polytopes and the planarity of subdivision
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Checking geometric programs or verification of geometric structures
Selected papers from the 12th annual symposium on Computational Geometry
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Flexible authentication of XML documents
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Certification of Computational Results
IEEE Transactions on Computers
A Simpler Minimum Spanning Tree Verification Algorithm
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Secure History Preservation Through Timeline Entanglement
Proceedings of the 11th USENIX Security Symposium
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Upward Planarity Checking: ``Faces Are More than Polygons''
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Efficient and Fresh Cerification
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Authentic Third-party Data Publication
Proceedings of the IFIP TC11/ WG11.3 Fourteenth Annual Working Conference on Database Security: Data and Application Security, Development and Directions
Checking the Integrity of Trees
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
On-Line Error Monitoring for Several Data Structures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Enabling the Archival Storage of Signed Documents
FAST '02 Proceedings of the 1st USENIX Conference on File and Storage Technologies
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
Efficient pebbling for list traversal synopses with application to program rollback
Theoretical Computer Science
Merkle Signatures with Virtually Unlimited Signature Capacity
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Merkle Tree Traversal Revisited
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Proceedings of the second ACM conference on Wireless network security
Single-Layer Fractal Hash Chain Traversal with Almost Optimal Complexity
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Performance of two one-time signature schemes in space/time constrained environments
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
A novel cryptoprocessor architecture for chained Merkle signature scheme
Microprocessors & Microsystems
The ForwardDiffsig scheme for multicast authentication
IEEE/ACM Transactions on Networking (TON)
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
An efficient authentication and simplified certificate status management for personal area networks
APNOMS'06 Proceedings of the 9th Asia-Pacific international conference on Network Operations and Management: management of Convergence Networks and Services
One-Time sensors: a novel concept to mitigate node-capture attacks
ESAS'05 Proceedings of the Second European conference on Security and Privacy in Ad-Hoc and Sensor Networks
Proving properties of incremental merkle trees
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Efficient cooperative signatures: a novel authentication scheme for sensor networks
SPC'05 Proceedings of the Second international conference on Security in Pervasive Computing
Auditable privacy: on tamper-evident mix networks
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
SHWMP: a secure hybrid wireless mesh protocol for IEEE 802.11s wireless mesh networks
Transactions on Computational Science VI
XMSS - a practical forward secure signature scheme based on minimal security assumptions
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Securing sensor reports in wireless sensor networks
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Hi-index | 0.00 |
Authenticated data structures provide cryptographic proofs that their answers are as accurate as the author intended, even if the data structure is maintained by a remote host. We present techniques for authenticating data structures that represent graphs and collections of geometric objects. In our model, a data structure maintained by a trusted source is mirrored at distributed directories that answer queries and provide proof of correctness. Our work has applications to the authentication of network management systems and geographic information systems.