Sciweavers

241 search results - page 32 / 49
» Machine-Checked Security Proofs of Cryptographic Signature S...
Sort
View
EUROCRYPT
2006
Springer
15 years 3 months ago
Perfect Non-interactive Zero Knowledge for NP
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
Jens Groth, Rafail Ostrovsky, Amit Sahai
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
15 years 3 months ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
14 years 9 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
GLOBECOM
2006
IEEE
15 years 5 months ago
Bank Transfer over Quantum Channel with Digital Checks
- In recent years, many quantum cryptographic schemes have been proposed. However, it seems that there are many technical difficulties to realize them (except Quantum Key Distribut...
Yoshito Kanamori, Seong-Moo Yoo, Frederick T. Shel...
ASIACRYPT
1999
Springer
15 years 4 months ago
How to Prove That a Committed Number Is Prime
Abstract. The problem of proving a number is of a given arithmetic format with some prime elements, is raised in RSA undeniable signature, group signature and many other cryptograp...
Tri Van Le, Khanh Quoc Nguyen, Vijay Varadharajan