Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations Andrey Bogdanov1 , Lars R. Knudsen2 , Gregor Leander2 , Francois-Xavier Standaert3 , John Steinberger4 , and Elmar Tis

Source URL: eprint.iacr.org

How Secure and Quick is QUIC? Provable Security and Performance Analyses Robert Lychev MIT Lincoln Laboratory

Source URL: www.sjero.net

Provable Algorithms for Machine Learning Problems Rong Ge A Dissertation

Source URL: users.cs.duke.edu

Spectral clustering is a well-known way to partition a graph or network into clusters or communities with provable guarantees on the quality of the clusters. This guarantee is known as the Cheeger inequality and it holds

Source URL: mmds-data.org

Practice-Oriented Provable Security and the Social Construction of Cryptography Phillip Rogaway∗ May 22, 2009† Abstract

Source URL: web.cs.ucdavis.edu

2015 IEEE Symposium on Security and Privacy How Secure and Quick is QUIC? Provable Security and Performance Analyses Robert Lychev MIT Lincoln Laboratory

Source URL: www.ieee-security.org

• Computing
• Internet protocols
• Cryptography
• Network architecture
• Cryptographic protocols
• Secure communication
• Computer networking
• QUIC
• Network protocols
• Datagram Transport Layer Security
• Comparison of TLS implementations
• Public-key cryptography

On the Role of Definitions in and Beyond Cryptography Phillip Rogaway Dept. of Computer Science, University of California, Davis, California 95616, USA, and Dept. of Computer Science, Fac. of Science, Chiang Mai Universi

Source URL: web.cs.ucdavis.edu

• Cryptography
• Pseudorandomness
• Advantage
• Semantic security
• Negligible function
• Provable security
• Concrete security
• Pseudorandom permutation
• Pseudorandom generator theorem
• Pseudorandom generator
• Ciphertext indistinguishability
• Block cipher

Conics over function fields and the Artin-Tate conjecture Jos´ e Felipe Voloch Abstract: We prove that the Hasse principle for conics over function fields is a simple consequence of a provable case of the Artin-Tate con

Source URL: www.ma.utexas.edu

• Algebraic number theory
• Algebraic curves
• Field theory
• Conjectures
• Diophantine geometry
• Tate conjecture
• Brauer group
• Algebraic number field
• Global field
• Divisor
• Finite field
• Artin

CASE STUDY Global Currency Stabilization Independently monitored and provable currency stabilization

Source URL: www.wocu.com

• Foreign exchange market
• International finance
• WDX Institute
• WOCU
• World currency unit
• Currency basket
• World currency
• Public-key cryptography
• Tamper-evident technology

A Model of Onion Routing with Provable Anonymity Joan Feigenbaum1? , Aaron Johnson1?? , and Paul Syverson2? ? ? 1 Yale University {Joan.Feigenbaum, aaron.johnson}@yale.edu

Source URL: www.cs.yale.edu

• Internet Standards
• Internet protocols
• Dark web
• Internet privacy
• Onion routing
• Routing
• Crowds
• Communications protocol
• Tor
• Proxy server
• Public-key cryptography
• Anonymity