XTR - PDFSEARCH.IO - Document Search Engine

XTR
Results: 836

#	Item
111	Forensic Steganalysis: Determining the Stego Key in Spatial Domain Steganography Jessica Fridrich∗, aMiroslav Goljan, bDavid Soukal, and aTaras Holotyak a a Add to Reading List Source URL: www.ws.binghamton.edu Language: English - Date: 2006-04-26 14:41:51 Steganography XTR Steganalysis Embedding Mathematics Espionage Topology
112	Pairing-Based Onion Routing with Improved Forward Secrecy ANIKET KATE, GREG M. ZAVERUCHA, and IAN GOLDBERG University of Waterloo This article presents new protocols for onion routing anonymity networks. We define a pro Add to Reading List Source URL: www.cypherpunks.ca Language: English - Date: 2010-12-30 09:39:44 Cryptographic software Boneh/Franklin scheme Finite fields Tor Onion routing XTR Diffie–Hellman key exchange Public-key cryptography Pairing Cryptography Internet privacy Cryptographic protocols
113	Discrete logarithm in GFwith FFS Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, Emmanuel Thomé, Marion Videau, and Paul Zimmermann CARAMEL project-team, LORIA, INRIA / CNRS / Add to Reading List Source URL: www.loria.fr Language: English - Date: 2014-01-09 15:35:58 Finite fields Logarithms Group theory Integer factorization algorithms Cryptography Index calculus algorithm XTR Polynomial Discrete logarithm Abstract algebra Mathematics Algebra
114	6013-B Wilson Blvd Arlington, VAPhone: Patient Case History Name: Add to Reading List Source URL: www.fullmotionlifeandsport.com Language: English - Date: 2012-03-02 10:53:51 FO Mathematics Modular arithmetic Quantification Universal quantification XTR
115	Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, France Add to Reading List Source URL: book.huihoo.com Language: English - Date: 2006-07-27 09:21:33 Cryptographic protocols Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange XTR Discrete logarithm ElGamal encryption Subliminal channels RSA Cryptography Computational hardness assumptions Finite fields
116	Optimally Robust Private Information Retrieval∗ Casey Devet Ian Goldberg University of Waterloo {cjdevet,iang}@cs.uwaterloo.ca Add to Reading List Source URL: www.cypherpunks.ca Language: English - Date: 2012-06-20 13:33:02 Theoretical computer science Cryptography Finite fields Polynomials Reed–Solomon error correction Berlekamp–Welch algorithm List decoding Randomized algorithm XTR Coding theory Error detection and correction Mathematics
117	A hybrid architecture for interactive verifiable computation Victor Vu, Srinath Setty, Andrew J. Blumberg, and Michael Walfish The University of Texas at Austin questions of the prover, and applies efficient tests to the Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2013-03-12 01:21:32 Complexity classes Cryptography Probabilistic complexity theory Circuit complexity IP Commitment scheme NP Randomized algorithm XTR Theoretical computer science Computational complexity theory Applied mathematics
118	Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice David Adrian¶ Karthikeyan Bhargavan∗ Zakir Durumeric¶ Pierrick Gaudry† Matthew Green§ J. Alex Halderman¶ Nadia Heninger‡ Drew Springall¶ Emmanuel Add to Reading List Source URL: weakdh.org Language: English - Date: 2015-05-22 22:25:48 Finite fields Computational hardness assumptions Group theory Diffie–Hellman key exchange XTR Secure Shell Cipher suite Index calculus algorithm Elliptic curve Diffie–Hellman Cryptography Abstract algebra Cryptographic protocols
119	Formal Certification of Code-Based Cryptographic Proofs Gilles Barthe1,2 Benjamin Gr´egoire1,3 Santiago Zanella1,3 Add to Reading List Source URL: software.imdea.org Language: English - Date: 2013-03-13 12:33:24 Function XTR Computability theory Model theory Μ operator Primitive recursive function Mathematics Mathematical logic Functions and mappings
120	Randomized Consensus in Expected O(n2 ) Total Work Using Single-Writer Registers James Aspnes? Yale University Abstract. A new weak shared coin protocol yields a randomized waitfree shared-memory consensus protocol that Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Martingale Probability and statistics Statistics Consensus XTR

UPDATE