Security and Cryptography for Networks

Deterministic Public Key Encryption and Identity-Based Encryptionfrom Lattices in the Auxiliary-Input Setting.- Ring Switching in BGV-Style Homomorphic Encryption.- Zero-Knowledge Proofs with Low Amortized Communication fromLattice Assumptions.- Fully Anonymous Attribute Tokens from Lattices.- Efficient Structure-Preserving Signature Scheme from StandardAssumptions.- Compact Round-Optimal Partially-Blind Signatures.- History-Free Sequential Aggregate Signatures.- A New Hash-and-Sign Approach and Structure-Preserving Signaturesfrom DLIN.- Blackbox Construction of a More Than Non-Malleable CCA1Encryption Scheme from Plaintext Awareness.- Decentralized Dynamic Broadcast Encryption.- Time-Specific Encryption from Forward-Secure Encryption.- Efficient Two-Party and Multi-Party ComputationImproved Secure Two-Party Computation via Information-TheoreticGarbled Circuits.- 5PM: Secure Pattern Matching.- Implementing AES via an Actively/Covertly Secure Dishonest-MajorityMPC Protocol.- On the Centrality of Off-Line E-Cash to Concrete Partial InformationGames.- Universally Composable Security with Local Adversaries.- On the Strength Comparison of the ECDLP and the IFP.- New Attacks for Knapsack Based Cryptosystems.- Multiple Differential Cryptanalysis Using LLR and 2 Statistics.- Quo Vadis Quaternion? Cryptanalysis of Rainbow overNon-commutative Rings.- Homomorphic Encryption for Multiplications and Pairing Evaluation.- Publicly Verifiable Ciphertexts.- Public-Key Encryption with Lazy Parties.- Probabilistically Correct Secure Arithmetic Computation for ModularConversion, Zero Test, Comparison, MOD and Exponentiation.- MAC Aggregation with Message Multiplicity.- Efficiency Limitations of Sigma-Protocols for Group HomomorphismsRevisited.- A More Efficient Computationally Sound Non-InteractiveZero-Knowledge Shuffle Argument.- Active Security in Multiparty Computation over Black-Box Groups.- Hash Combiners for Second Pre-image Resistance, Target CollisionResistance andPre-image