Negligible function - PDFSEARCH.IO - Document Search Engine

Negligible function
Results: 10

#	Item
1	E:/Documents/Courses/Spring 2011/gc/dyn/dyn.dvi Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-06-30 14:19:02 Mathematics Algebraic topology Sheaf Negligible function
2	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 Add to Reading List Source URL: web.cs.ucdavis.edu Language: English - Date: 2005-06-19 20:47:33 Cryptography Pseudorandomness Advantage Semantic security Negligible function Provable security Concrete security Pseudorandom permutation Pseudorandom generator theorem Pseudorandom generator Ciphertext indistinguishability Block cipher
3	Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch Add to Reading List Source URL: fc15.ifca.ai Language: English - Date: 2015-01-11 00:32:58 Cryptography Computational complexity theory Distance-bounding protocol Public-key cryptography Complexity classes Proof of knowledge IP Challengeresponse authentication NP Digital signature Security parameter Negligible function
4	When and How Can Data be Efficiently Released with Privacy? Cynthia Dwork Moni Naor∗ Omer Reingold Salil Vadhan Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-11-01 14:13:39 Data privacy Applied probability Exponential mechanism Time complexity Differential privacy Constructible universe Polynomial Negligible function PP Theoretical computer science Mathematics Computational complexity theory
5	An abridged version of this paper appears in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996. Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security Mihir Be Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2005-10-31 17:44:37 Applied mathematics Algorithmic information theory Pseudorandom generator Computational complexity theory Pseudorandom function family One-way function Advantage Negligible function Function Cryptography Theoretical computer science Pseudorandomness
6	A preliminary version of this paper appears in ASIACRYPTThis is the full version appearing as IACR ePrint Archive ReportPoly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inp Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-09-14 20:30:39 One-way function Injective function Polynomial Function Negligible function P Mathematics Functions and mappings Mathematical analysis
7	The dichotomy between structure and randomness International Congress of Mathematicians, Aug[removed]Terence Tao (UCLA) Add to Reading List Source URL: www.math.ucla.edu Language: English - Date: 2006-08-14 15:09:49 Pseudorandomness Theoretical computer science John von Neumann Negligible function Fourier analysis Randomness Decomposition Complexity Equivalence of categories Mathematics Science Mathematical analysis
8	The dichotomy between structure and randomness International Congress of Mathematicians, Aug[removed]Terence Tao (UCLA) Add to Reading List Source URL: www.math.ucla.edu Language: English - Date: 2006-08-14 15:09:49 Pseudorandomness Theoretical computer science John von Neumann Negligible function Fourier analysis Randomness Decomposition Complexity Equivalence of categories Mathematics Science Mathematical analysis
9	MA1C 2010 MIDTERM SOLUTIONS Problem 1 Let W = { n1 : n ≥ 1}. a. Deduce that W is negligible, i.e. has measure zero in R. b. Prove that W is not closed. c. Determine its boundary ∂W . Add to Reading List Source URL: math.caltech.edu Language: English - Date: 2010-05-17 16:04:09 Functions and mappings Multivariable calculus Derivative Differential calculus Multiple integral Continuous function Vector space Function Mathematics Algebra Mathematical analysis
10	Commitment Schemes and Zero-Knowledge Protocols[removed]Ivan Damg˚ Add to Reading List Source URL: www.daimi.au.dk Language: English - Date: 2008-02-13 04:47:39 Commitment scheme Randomized algorithm One-way function PP IP RSA Ciphertext indistinguishability Negligible function Computational complexity theory Theoretical computer science Cryptography Applied mathematics

UPDATE