- Channel Allocation Problem Mathematical Preliminaries
- Science for Global Ubiquitous Computing A fifteen-year Grand Challenge for computing research
- May 1988 vol. 31. No. 5 COMMUNICATION OF THE ACM"&" STALKING THE WILY HACKER
- CSE 4153 / 6153, Fall 2010, Quiz 3 Solutions 1. A satellite serving 100 stations can receive a maximum of 10,000 packets per second. If the channel is
- A generic characterization of the overheads imposed by IPsec and associated cryptographic algorithms
- Symmetric Ciphers Mahalingam Ramkumar
- Review of TCP/IP Networks Mahalingam Ramkumar
- CSE 4153 / 6153 Take Home Quiz 5 Solutions 1. What are the 3 timers used in the TCP layer. Explain their purpose.
- Channel Allocation Problem Medium Access Protocols
- FFT BASED SIGNALING FOR MULTIMEDIA STEGANOGRAPHY Mahalingam Ramkumar and Ali N. Akansu
- Information Transmission Media
- Security Analysis for P2P Routing Protocols Tatsuro Fujii
- Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks
- Robust Protocols for Proving Ownership of Images Mahalingam Ramkumar and Ali N. Akansu
- CSE 4153 / 6153, Spring 2008, Assignment 2 Name /Net ID_________________________________ Due 2 pm, 20 Feb.
- CSE 4383/6383, Fall 2007, Key distribution, PGP 1. Explain the following attacks
- Int. J. Security and Networks, Vol. 1, Nos. 1/2, 2006 113 Secure collaborations over message boards
- Network Layer Quiz (CSE 4153/6153 Spring 2009) Name___________________NetID_________ (Due Thu, 26th
- Trustworthy Computing under Resource Constraints with the DOWN Policy
- Floating Signal Constellations for Multimedia Steganography Mahalingam Ramkumar, Ali N. Akansu and Xiaodong Cai
- CSE 4153 / 6153 Take Home Quiz 2 Name / Net ID_________________________________ (Due Tue 17th
- Network Layer Quiz Solutions 1. State True or False (Provide a oneline explanation)
- CSE 4153/6153 Assignment 4 (Transport Layer) Due Wed Oct 31, 10 AM 1. Explain the process of i) connection establishment and ii) termination of a connection in TCP
- Problem Areas for the IP Security Protocols Steven M. Bellovin
- Mahalingam Ramkumar TCP/IP Example
- CS 4990 / 6990 Assignment 7 Due Nov 20 2003
- An Efficient Broadcast Authentication Scheme for Ad Hoc Routing Protocols
- CSE 4153 / 6153 Take Home Test 4 Spring 2008 1. What is flooding? Explain the need for sequence number and age. (5 points)
- COURSE SYLLABUS FALL SEMESTER 2003
- CSE 4383/6383 Quiz 4 Name / Net ID__________________________________ Provide indepth answers (78 lines)
- A Framework for Integrated Internet and'Adhoc Network Security Bin Xie and Anup Kumar
- Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures
- OLSR SCALING WITH HIERARCHICAL ROUTING AND DYNAMIC TREE Emmanuel Baccelli
- Security in an autonomic computing
- CS 4153 / 6153 -Quiz 4, 30 Minutes Name:_______________________ Spring 2005
- The " fabric" of life! Holds civilizations together
- A NEW PERSPECTIVE FOR EMBEDDINGDETECTION METHODS WITH DISTORTION COMPENSATION AND THRESHOLDING PROCESSING TECHNIQUES
- A Security Routing Algorithm of P2P Network Based on Asymmetric Nested Encryption
- New Tricks For Defeating SSL In Moxie Marlinspike
- I-HARPS: An Efficient Key Predistribution Scheme for Mobile Computing Applications
- Image Watermarks and Counterfeit Attacks: Some Problems and Solutions
- Cryptographic Versus Trust-based Methods for MANET Routing Security
- Information Flow Based Routing Algorithms for Wireless Sensor Networks
- Minimal Trusted Computing Base for MANET Vinay Thotakura, Mahalingam Ramkumar
- CSE 4153/6153 Fall 2009 Due Wed Sep 23, 10 AM 1) Indicate the positions where a zerobit needs to be stuffed if the following frame is to be sent
- Asymmetric Cryptography Mahalingam Ramkumar
- Intrusion Detection and Firewalls 1. What is base-rate fallacy in the context of statistical intrusion detection.
- CSE 4153 / 6153 Fall 2006 Quiz 2 (20 minutes) Name & NetID______________________________________ 1. What is the minimum number of redundant bits r needed for a Hamming code for correcting all possible one bit errors, if the
- ON THE CHOICE OF TRANSFORMS FOR DATA HIDING IN COMPRESSED VIDEO Mahalingam Ramkumar, Ali N. Akansu and A. Aydn Alatan
- Improving the Resiliency of Ariadne Kulasekaran A. Sivakumar and Mahalingam Ramkumar
- 2003 Conference on Information Sciences and Systems, The Johns Hopkins University, March 12{14, 2002 Multiple Codebook Information Hiding Based On Minimum Distortion
- Acknowledgements i Abstract vii
- CS 4990 / 6990 Lecture Notes Digital Signatures
- A ROBUST DATA HIDING SCHEME FOR IMAGES USING DFT Mahalingam Ramkumar, Ali N. Akansu and A Ayd n Alatan
- A ROBUST SCHEME FOR OBLIVIOUS DETECTION OF WATERMARKS / DATA HIDING IN STILL IMAGES \Lambda
- 2001 Conference on Information Sciences and Systems, The Johns Hopkins University, March 21{23, 2001 Ecient Codebook Structures for Practical Information Hiding
- Mathematical Preliminaries Digital Signatures
- CSE 4153 / 6153 Fall 2010 Quiz 2 Solutions 1. What is the minimum number of redundant bits r needed for a Hamming code for correcting all possible one bit errors, if the
- Connections Transport Layer
- A PERFORMANCE STUDY OF DCT AND SUBBAND IMAGE CODECS WITH ZERO-ZONE M.Ramkumar and A.Akansu
- Socket Programming Socket Programming
- ON THE IMPLEMENTATION OF 2BAND CYCLIC FILTERBANKS M.Ramkumar, G.V. Anand \Lambda and Ali N. Akansu
- October 12, 2004 1 Email Security
- Bootstrapping the Adoption of Internet Security Protocols Andy Ozment Stuart E. Schechter
- The "fabric" of life! Holds civilizations together
- Introduction Key Predistribution
- Web Security Mahalingam Ramkumar
- An Efficient Secure Route Discovery Protocol for Kulasekaran A. Sivakumar and Mahalingam Ramkumar
- Secure Link State Routing for Mobile Ad Hoc Networks Panagiotis Papadimitratos
- Game Theoretic Approach in Multipath Routing for Tradeoff between Routing Security and Performance
- CSE 4153 / 6153, Fall 2010, Midterm Name /Net ID_________________________________ 1. What is the capacity C of a channel with a bandwidth of 10,000 Hz and a signal to noise ratio of
- Information Transmission Media
- CONNOTECH Experts-conseil inc. Tel.: +1-514-385-5691 9130 Place de Montgolfier Fax: +1-514-385-5900
- Authentication / Key Distribution Mahalingam Ramkumar
- International Journal of Network Security, Vol.4, No.2, PP.166-178, Mar. 2007 166 Broadcast Authentication With Preferred
- CSE 4153 / 6153 Take Home Test 4 Spring 2008 1. What is flooding? Explain the need for sequence number and age. (5 points)
- CSE 4153 / 6153, Spring 2008, Midterm Solutions 1.What is the capacity C of a channel with a bandwidth of 10,000 Hz and a signal to noise ration of 20
- CSE 4153 / 6153 Quiz 1 Solutions Name / Net ID_________________________________ 1. What are the seven layers in the OSI model? Briefly (one to two lines) explain the function of each
- IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 2, FEBRUARY 2006 305 Information Theoretic Framework of Trust Modeling
- THEORETICAL CAPACITY MEASURES FOR DATA HIDING IN COMPRESSED IMAGES \Lambda
- A ROBUST TYPEIII DATA HIDING TECHNIQUE AGAINST CROPPING & RESIZING Husrev T. Sencar 1 , Mahalingam Ramkumar 2 , Ali N. Akansu 1
- Proceedings of the 2005 IEEE Workshop on Information Assurance and Security
- A New Family of Authentication Protocols Ross Anderson1, Francesco Bergadano2, Bruno Crispo2,
- CSE 4153 / 6153 Fall 2010 Quiz 2 Name & NetID_________________________________________________ 1. What is the minimum number of redundant bits r needed for a Hamming code for correcting all possible one bit errors, if the
- Services Provides By DL Layer Error Control
- WHY CRYPTOGRAPHY IS HARDER THAN IT LOOKS
- Broadcast Encryption Using Probabilistic Key Distribution and Applications
- An important issue that continues to arise in the
- Obtaining Non-repudiable Proof of Active Attacks Kulasekaran A. Sivakumar, Mahalingam Ramkumar
- Leveraging a Minimal Trusted Computing Base for Securing On-Demand MANET Routing Protocols
- On the Complexity of Probabilistic Key Predistribution Schemes
- Private Logical Neighborhoods for Ad Hoc Kulasekaran Sivakumar, Mahalingam Ramkumar
- Proxy Aided Key Pre-distribution Schemes for Sensor Networks
- Safeguarding Mutable Fields in AODV Route Discovery Process
- Proceedings of the 2007 IEEE Workshop on Information Assurance
- On the Feasibility of Very Low Complexity Trust Modules Using PKPS Synergies
- On the Effect of One-way Links on Route Discovery in DSR
- A DRM Based on Renewable Broadcast Encryption Mahalingam Ramkumara and Nasir Memonb
- An Efficient Random Key Pre-distribution Scheme Mahalingam Ramkumar
- PRELOADED KEY DISTRIBUTION SCHEMES FOR AD HOC NETWORKS Mahalingam Ramkumar
- Proceedings of the 2004 IEEE Workshop on Information Assurance and Security
- AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
- Secure Routing Protocols in Ad Hoc Networks: A Review Special Issue of IJCCT Vol. 2 Issue 2, 3, 4; 2010 for International Conference [ICCT-2010], 3rd
- Trust Enhanced Dynamic Source Routing Protocol for Adhoc Networks
- MULTILEVEL SECURITY FOR IP ROUTING Eli Winjum and Tore J. Berg
- 582 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 18, NO. 4, APRIL 2000 Secure Border Gateway Protocol (S-BGP)
- Routing Protocol Security Using Symmetric Key Based Techniques
- Peer-to-Peer Netw. Appl. DOI 10.1007/s12083-010-0084-0
- Introduction TCP/IP Network Layers
- Services Provides By DL Layer Error Control
- Connectionless Services Routing Algorithms
- Connections Transport Layer
- Application Layer Mahalingam Ramkumar
- CSE 4383/6383 QUIZ 1 FALL 2010 Solutions 1. Explain the terms confusion and diffusion in the context of block-ciphers.
- CSE 4383/6383, Fall 2010, Quiz 3 Name /Net ID___________________________ 1. Briefly explain the following attacks: (6 points)
- Modular Arithmetic (Read Sections 4.1 thro 4.4)
- Challenge-Response Protocols Key Distribution
- Introduction PGP Operation
- Wireless Networks Mahalingam Ramkumar
- Intruders and Intrusion Mahalingam Ramkumar
- Symmetric Cryptography Asymmetric Cryptography
- CSE 4153/6153 Fall 2009 Due Wed Sep 23, 10 AM 1) Indicate the positions where a zerobit needs to be stuffed if the following frame is to be sent
- CSE 4153 / 6153, Fall 2009, Assignment 4, Due Wed 7 Oct, 10 AM Name /Net ID_________________________ 1. A satellite serving 100 stations can receive a maximum of 10,000 packets per second. If the channel is
- CSE 4153/6153 Fall 2009 Due Wed Oct 28 10 AM Name/NetID___________________________ 1. What are some of the fundamental differences between distance vector and linkstate routing
- CSE 4383/6383 Midterm Spring 2009 Name_______________________NetID_________ 1. For RSA with the choice of p=13 and q=17.
- CSE 4383/6383 Assignment 2 Spring 09 (Due Feb 17) Name / NetID___________________________ 1. Briefly explain the terms "confusion" and "diffusion" in the context of symmetric ciphers.
- Data Link Layer Quiz (CSE 4153/6153 Spring 2009) Name___________________NetID________________ Due Thu 26 March
- Data Link Layer Quiz (CSE 4153/6153 Spring 2009) Name___________________NetID________________ Due Thu 26 March
- CSE 4383/6383 Assignment 5 Spring 09 (Due Apr 9) Name / NetID___________________________ 1. Explain the need for different types of MAC layer protocols like ALOHA, CSMA, CSMA-CA and CSMA-CD
- On the E ciency of One-time Digital Signatures Daniel Bleichenbacher1 and Ueli Maurer2
- CONNOTECH Experts-conseil inc. Tel.: +1-514-385-5691 9130 Place de Montgolfier Fax: +1-514-385-5900
- Incentives and Disincentives for DNSSEC Deployment Christof Fetzer and Trevor Jim
- CSE 4153/6153 Assignment 2 Fall 2008 Due Wed Sep 24, 10 AM 1) (2 Points) A datalink channel employs bitstuffing for framing. If the frame consists of the following
- CSE 4153/6153 Assignment 1 Solutions Fall 2008 1. What are the seven network layer in the OSI model? Briefly (one or two lines) explain their functions
- Services Provides By DL Layer Error Control
- Channel Allocation Problem Medium Access Protocols
- Connectionless Services Routing Algorithms
- Application Layer Mahalingam Ramkumar
- CSE 4153 / 6153, Spring 2008, Assignment 1 Name /Net ID_________________________________ Due 2 pm, 06 Feb.
- CSE 4153 / 6153 Take Home Quiz 5 Solutions 1. What are the 3 timers used in the TCP layer. Explain their purpose.
- Introduction Socket Programming
- Information Transmission Media
- CSE 4153/6153, Fall 2007, Mid Term Symmetric ciphers
- CSE 4383/6383, Fall 2007, Quiz 3 Name /Net ID__________________________________________ 1. Explain the following attacks
- CSE 4153 / 6153, Fall 2007 Name / Net ID_______________________________________ 1. In a DL layer that employs a flag 01111110, a packet with the following data bits need to be transmitted
- Mobile Ad Hoc Networks: Routing, MAC and Transport Issues
- Secure Routing with the AODV Protocol Asad Amir Pirzada and Chris McDonald
- In Proceedings of the SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 27-31, 2002
- Securing Ad Hoc Networks Using Ariadne JAVIER BONNY MOUNIR KRICHANE
- Journal of Network and Systems Management, Vol. 14, No. 4, December 2006 ( c 2006) DOI: 10.1007/s10922-006-9043-8
- Consensus and Collision Detectors in Wireless Ad Hoc Networks
- Multicast Security: A Taxonomy and Some Efficient Constructions
- Protecting Cryptographic Keys and Computations via Virtual Secure Coprocessing
- IBM Common Cryptographic Architecture (CCA) and
- CONCURRENCY AND COMPUTATION: PRACTICE AND EXPERIENCE Concurrency Computat.: Pract. Exper. 2004; 16:10771098 (DOI: 10.1002/cpe.805)
- CS 6153 End of Course Project (To be performed in teams of 2)
- CS 4153 / 6153 -Midterm, 75 Minutes Spring 2005 Name:_____________________ 1. What are the differences between the upstream channels of DSL and Cable based Internet
- CS 4990 / 6990 Solutions to Quiz 2
- CS 4990 / 6990 Solutions to Assignment 4
- CS 4990 / 6990 Solutions to Assignment 5
- Di erential Power Analysis Paul Kocher, Joshua Ja e, and Benjamin Jun
- Robustness principles for public key protocols Ross Anderson and Roger Needham
- Technical Report Computer Laboratory
- IMPROVEMENTS ON DATA HIDING FOR LOSSY COMPRESSION Husrev T. Sencar 1 , Ali N. Akansu 1 , Mahalingam Ramkumar 2
- Web Security Mahalingam Ramkumar
- A Framework for Dual-Agent MANET Routing Brian L. Gaines and Mahalingam Ramkumar
- CSE 4383/6383 Assignment 2, Spring 07 Name / NetID___________________________ 1. Use the square and multiply algorithm to evaluate 234231
- The Hierarchical Threat Model of Routing Security for wireless Ad hoc Networks College of Electrical and
- INCREASING ROBUSTNESS OF IMAGE WATERMARKS TO COUNTERFEIT Mahalingam Ramkumar, Ali N. Akansu and A. Ayd
- Trusted Route Discovery with TORA Protocol Asad Amir Pirzada, Chris McDonald
- ESIMS -An Efficient Key Predistribution Scheme Mahalingam Ramkumar, Nasir Memon
- Channel Allocation Problem Mathematical Preliminaries
- CSE 4153 / 6153, Fall 2008, Assignment 7 Solutions 1. A satellite serving 100 stations can receive a maximum of 10,000 packets per second. If the channel is
- A Cryptographic Evaluation of IPsec Niels Ferguson and Bruce Schneier
- A System for Digital Rights Management Using Key Predistribution
- CSE 4153/6153 Assignment 3 Fall 2008 Due Fri Oct 3, 10 AM 1. What is flooding? Explain the need for sequence number and age in packets that are flooded. (5
- A Hierarchical Key Pre-distribution Scheme Mahalingam Ramkumar
- CSE 4153/6153 Assignment 4 (1) Connection establishment in TCP
- CSE 4153 / 6153, Fall 2010 Quiz 1 Solutions 1. What is the maximum bit-rate of a channel with a bandwidth of 1000 Hz if the SNR is 30 dB? If the
- Security Issues Much of security-related stuff is mostly beyond my
- Pre-Loaded Key Based Multicast and Broadcast Authentication in Mobile Ad-Hoc Networks
- CSE 4153/6153 Assignment 2 1) (2 Points) A datalink channel employs bitstuffing for framing. If the frame consists of the following
- CSE 4153/6153 Quiz 4 Fall 2006 Name & NetID_______________________________________ 1. Highlight the differences between distance-vector and link-state routing approaches in terms of
- Connections Transport Layer
- Introduction Ad Hoc Networks -Routing and Security Issues
- DATA HIDING IN MULTIMEDIA -THEORY AND APPLICATIONS Mahalingam Ramkumar
- MAC Games for Distributed Wireless Network Security with Incomplete Information of Selfish and Malicious User Types
- Feedback: Towards Dynamic Behavior and Secure Routing for Wireless Sensor Zhen Cao, Jianbin Hu, Zhong Chen, Maoxing Xu, Xia Zhou
- Beej's Guide to Network Programming Using Internet Sockets
- Mobile Networks and Applications 10, 985995, 2005 C 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands.
- Table 14.1 Summary of Kerberos Version 4 Message Exchanges (1) C AS IDc || IDtgs || TS1
- 2002 Conference on Information Sciences and Systems, Princeton University, March 20{22, 2002 Multiple Codebook Information Hiding
- CS 4990 / 6990 Lecture Notes Mathematical Foundations for Asymmetric Cryptography
- On the Scalability of an Efficient "Nonscalable" Key Distribution Scheme Mahalingam Ramkumar
- CSE 4153/6153 DL Layer Fall 2007 Whenever a series of 5 consecutive bits occur we need to stuff a 0 at the end of the sequence. The receiver (whenever it sees a
- CSE 4153/6153 Assignment 5 Fall 2008 Solutions 1. Briefly explain (2 3 lines) the following protocols
- CSE 4383/6383, Fall 2007 Name / Net ID_______________________________________ 1. Evaluate the following (4 points)
- CSE 4153 / 6153 Assignment 3 Fall 2008 1. What is flooding? Explain the need for sequence number and age in packets that are flooded. (5
- CSE 4383/6383, Fall 2007 Name / Net ID_______________________________________ 1. Evaluate the following (4 points)
- CSE 4153 / 6153, Fall 2009, Assignment 4, Due Wed 7 Oct, 10 AM Name /Net ID_________________________ 1. A satellite serving 100 stations can receive a maximum of 10,000 packets per second. If the channel is
- INFORMATION THEORETIC BOUNDS FOR DATA HIDING IN COMPRESSED
- A NEW METHODOLOGY FOR DETECTION OF WATERMARKS IN GEOMETRICALLY DISTORTED IMAGES
- SELF-NOISE SUPPRESSION SCHEMES IN BLIND IMAGE STEGANOGRAPHY
- SOME DESIGN ISSUES FOR ROBUST DATA HIDING SYSTEMS Mahalingam Ramkumar and Ali N. Akansu
- CS 4990 / 6990 Assignment 6 Due Nov 13 2003
- Scalable Ubiquitous Computing Systems Ubiquitous Systems
- CSE 4153/6153 Final Examination, Fall 2006 Name / Net ID_______________________________ 1. A communication channel has a bandwidth of 6000 Hz and a signal to noise ratio of 20 dB. Calculate the capacity (in bits
- Firewalls and IDS 1) Both stateless and stateful firewalls inspect portions of IP and TCP headers like destination and source IP addresses, and destination
- CS 4153 / 6153 -Quiz 4, 25 Minutes Name:__________________________Net ID:_________ 1. Briefly explain the need for a) sequence numbers and b) age in link-state packets. (4 points)
- CSE 4383/6383, Fall 2007, Quiz 1 Name /Net ID__________________________________________ Max Points: 15 Duration: 20 Minutes
- Securing Ad Hoc Networks With "Asymmetric" Probabilistic Key Predistribution Mahalingam Ramkumar
- CSE 4153 / 6153, Spring 2008, Assignment 2 Name /Net ID_________________________________ Due 2 pm, 20 Feb.
- CSE 4383/6383 QUIZ 1 FALL 2010 Name/NetID:________________________ 1. Explain the terms confusion and diffusion in the context of block-ciphers.
- 1. Using Dijkstra's Algorithm, calculate the shortest path from E to all other nodes Clearly enumerate each step in the process
- International Journal of Information Technology Vol. 11 No. 2 Mobile ad hoc networks will often be deployed in environments where the nodes of the networks are
- CS 4990 / 6990 Lecture Notes Mathematical Foundations for Asymmetric Cryptography
- Mahalingam Ramkumar Evolution of Networks
- A Secure DSDV Routing Protocol for Ad Hoc Mobile Networks
- 17. Dijkstra, E.W. After many a sobering experience. E.W. Dijkstra note EWD500.
- Pollard's Algorithm for Discrete Logarithm Professor Dr. D. J. Guan
- CSE 4153/6153 Quiz 5 Fall 2011 Name/NetID_______________________________ 1. Briefly explain the role of the following entities in the operation of the domain name system
- CSE 4153/6153 Quiz 4 Fall 2011 Name/NetID_______________________________ 1. Briefly discuss how various field in the TCP header are used in the connection establishment and termination process in TCP
- CSE 4383/6383, Quiz 4 Fall 2011 Name / Net ID__________________________ 1. Whats are "services" and "modes" in the context of IPSec?
- CSE 4383/6383, Quiz 2 Fall 2011 Name / Net ID__________________________ 1. Evaluate the following (4 points)
- CSE 4153/6153 Quiz 3 Fall 2011 Name/NetID_______________________________ 1. What is flooding? Explain the need for sequence number and age in packets that are flooded.
- CSE 4153 / 6153, Fall 2011, Quiz 2 Name /Net ID_________________________________ 1. A communication channel employs a (11,15) Hamming error correction code. The sequence of
- CSE 4383/6383, Quiz 3 Fall 2011 Name / Net ID__________________________ 1. Explain a typical approach for poisoning the cache of a DNS server.
- Dynamic Provable Data Possession C. Chris Erway Alptekin Kupcu Charalampos Papamanthou Roberto Tamassia
- : An Authenticated Dictionary Based on Skip Lists for Timestamping Systems
- An Efficient Dynamic and Distributed Cryptographic Accumulator
- Cryptography for Efficiency: Authenticated Data Structures Based on Lattices and
- Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
- Skip List Based Authenticated Data Structure in DAS Jieping Wang1,2
- Authentic Data Publication over the Internet Premkumar Devanbu, Michael Gertz, Charles Martel Stuart G. Stubblebine
- Persistent Authenticated Dictionaries and Their Applications
- Certification and Authentication of Data Structures Roberto Tamassia
- query result + verification-object
- A Certificate Status Checking Protocol for the Authenticated Dictionary
- Dynamic Authenticated Index Structures for Outsourced Marios Hadjieleftheriou
- Super-efficient Aggregating History-independent Persistent Authenticated Dictionaries
- Authenticated Data Structures for Graph and Geometric Searching Michael T. Goodrich
- The following paper was originally published in the Proceedings of the 7th USENIX Security Symposium
- Authenticated Dictionaries for Fresh Attribute Credentials
- Efficient Content Authentication over Distributed Hash Tables Roberto Tamassia
