Eprint - PDFSEARCH.IO - Document Search Engine

Eprint
Results: 2085

#	Item
971	Twisted Jacobi Intersections Curves Rongquan Feng1 , Menglong Nie1 , Hongfeng Wu2 1 LMAM, School of Mathematical Sciences, Peking University, Beijing, P.R. China Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-04 06:04:06 Group theory W postcode area Coil W12 Geography of England Elliptic curve cryptography Elliptic curves London Analytic number theory Elliptic curve
972	A preliminary version appears in ISC 2009, Lecture Notes in Computer Science, Springer-Verlag, 2009. This version is dated December 18, 2009. Security Analysis of the PACE Key-Agreement Protocol Jens Bender1 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-12-18 06:37:52 Diffie–Hellman key exchange Key-agreement protocol Advantage Diffie–Hellman problem Cryptographic nonce Adversary model SPEKE Secure Remote Password protocol Cryptography Cryptographic protocols Random oracle
973	Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS Seung Geol Choi∗ Jonathan Katz† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-05-14 14:54:31 Ciphertext indistinguishability Oblivious transfer Computational indistinguishability Cryptographic hash function Chosen-ciphertext attack Zero-knowledge proof Diffie–Hellman problem RSA Cryptography Cryptographic protocols Common reference string model
974	A SPECTS OF H YPERELLIPTIC C URVES OVER L ARGE P RIME F IELDS IN S OFTWARE I MPLEMENTATIONS Roberto Maria Avanzi Institute for Experimental Mathematics (IEM) Ellernstrasse 29, DEssen, Germany Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-12-17 09:09:41 Geometry Elliptic curve Hyperelliptic curve Divisor Abelian variety Lenstra elliptic curve factorization Imaginary hyperelliptic curve Abstract algebra Algebraic geometry Algebraic curves
975	On Concurrently Secure Computation in the Multiple Ideal Query Model∗ Abhishek Jain‡ Vipul Goyal† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-07 10:35:40 Software Universal composability Data Secure multi-party computation Advantage Actor model Ciphertext indistinguishability Adversary model Security parameter Cryptographic protocols Cryptography Computing
976	Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations Pille Pullonen1,2 and Sander Siim1,2 1 Cybernetica AS Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-10 10:34:14 Information Cryptography Secure multi-party computation Key management Communications protocol Lookup table Homomorphic encryption Secret sharing Transmission Control Protocol Cryptographic protocols Data Computing
977	Minimal Assumptions for Efficient Mercurial Commitments∗ Yevgeniy Dodis† Abstract Mercurial commitments were introduced by Chase et al. [8] and form a key building block for constructing zero-knowledge sets (introduc Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-11-30 14:18:39 Cryptographic protocols Trapdoor function Claw-free permutation One-way function Zero-knowledge proof XTR Mercurial Permutation Communications protocol Cryptography Public-key cryptography Commitment scheme
978	On Achieving the “Best of Both Worlds” in Secure Multiparty Computation∗ Jonathan Katz† Abstract Two settings are typically considered for secure multiparty computation, depending on Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-01-08 13:33:41 Secure multi-party computation IP Adversary model Transmission Control Protocol Cryptography Mathematics Computing Cryptographic protocols Applied mathematics Analysis of algorithms
979	A preliminary version of this paper appeared in Theory of Cryptography Conference, TCC ’05, Lecture Notes in Computer Science Vol. ???, Joe Kilian ed, Springer Verlag, 2005. This is the full version. Secure Computation Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-15 13:27:27 Computability theory Oracle machine
980	Round-Optimal Zero-Knowledge Proofs of Knowledge for NP Li HongDa†1 , Feng DengGuo2 , Li Bao1 , Xu HaiXia1 1 State Key Lab of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, C Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-12-15 09:42:20 Cryptographic protocols Probabilistic complexity theory Complexity classes Interactive proof system Proof of knowledge Zero-knowledge proof IP Soundness Commitment scheme Theoretical computer science Applied mathematics Computational complexity theory

UPDATE