SECURITY AND CRYPTOGRAPHY FOR NETWORKS

By JOSHUA SANCHEZ

IMPLEMENTING TWO-PARTY COMPUTATION E?CIENTLY WITH SECURITY AGAINST MALICIOUS ADVERSARIES CLL: A CRYPTOGRAPHIC LINK LAYER FOR LOCAL AREA NETWORKS FASTER MULTI-EXPONENTIATION THROUGH CACHING: ACCELERATING (EC)DSA SIGNATURE VERI?CATION PRIVACY PRESERVING DATA MINING WITHIN ANONYMOUS CREDENTIAL SYSTEMS IMPROVED PRIVACY OF THE TREE-BASED HASH PROTOCOLS USING PHYSICALLY UNCLONABLE FUNCTION TWO GENERIC CONSTRUCTIONS OF PROBABILISTIC CRYPTOSYSTEMS AND THEIR APPLICATIONS CRAMER-SHOUP SATIS?ES A STRONGER PLAINTEXT AWARENESS UNDER A WEAKER ASSUMPTION GENERAL CERTI?CATELESS ENCRYPTION AND TIMED-RELEASE ENCRYPTION E?CIENT CERTI?CATE-BASED ENCRYPTION IN THE STANDARD MODEL AN IMPROVED ROBUST FUZZY EXTRACTOR ON LINEAR SECRET SHARING FOR CONNECTIVITY IN DIRECTED GRAPHS EXPRESSIVE SUBGROUP SIGNATURES ANONYMOUS PROXY SIGNATURES MULTISIGNATURES USING PROOFS OF SECRET KEY POSSESSION, AS SECURE AS THE DI?E-HELLMAN PROBLEM USING NORMAL BASES FOR COMPACT HARDWARE IMPLEMENTATIONS OF THE AES S-BOX A NEW ANALYSIS OF THE MCELIECE CRYPTOSYSTEM BASED ON QC-LDPC CODES FULL CRYPTANALYSIS OF LPS AND MORGENSTERN HASH FUNCTIONS A NEW DPA COUNTERMEASURE BASED ON PERMUTATION TABLES SIMPLI?ED SUBMISSION OF INPUTS TO PROTOCOLS UNCONDITIONALLY RELIABLE AND SECURE MESSAGE TRANSMISSION IN DIRECTED NETWORKS REVISITED LINEAR BANDWIDTH NACCACHE-STERN ENCRYPTION IMMUNISING CBC MODE AGAINST PADDING ORACLE ATTACKS: A FORMAL SECURITY TREATMENT CONSTRUCTING STRONG KEM FROM WEAK KEM (OR HOW TO REVIVE THE KEM/DEM FRAMEWORK) NEW ANONYMITY NOTIONS FOR IDENTITY-BASED ENCRYPTION A UNIVERSALLY COMPOSABLE GROUP KEY EXCHANGE PROTOCOL WITH MINIMUM COMMUNICATION E?ORT AN IDENTITY-BASED KEY AGREEMENT PROTOCOL FOR THE NETWORK LAYER