Sciweavers

974 search results - page 23 / 195
» pairing 2010
Sort
View
IACR
2011
152views more  IACR 2011»
12 years 7 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
TRUST
2010
Springer
14 years 21 days ago
A Pairing-Based DAA Scheme Further Reducing TPM Resources
Direct Anonymous Attestation (DAA) is an anonymous signature scheme designed for anonymous attestation of a Trusted Platform Module (TPM) while preserving the privacy of the devic...
Ernie Brickell, Jiangtao Li
EUROCRYPT
2010
Springer
14 years 14 days ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
INFORMATICALT
2010
126views more  INFORMATICALT 2010»
13 years 6 months ago
Identity-Based Threshold Proxy Signature from Bilinear Pairings
Abstract. Delegation of rights is a common practice in the real world. We present two identitybased threshold proxy signature schemes, which allow an original signer to delegate he...
Jenshiuh Liu, Shaonung Huang
KBSE
2010
IEEE
13 years 6 months ago
An automated approach for finding variable-constant pairing bugs
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
Julia L. Lawall, David Lo