Oblivious Single Access Machines are Concretely Efficient

Sage Pia, Ananya Appan, Maryam Rezapour, Amey Shukla, Nikhil Date, Benjamin Fuller 0001, Ling Ren 0001, David Heath. Oblivious Single Access Machines are Concretely Efficient. IACR Cryptology ePrint Archive, 2026:451, 2026. [doi]

Authors

Sage Pia

This author has not been identified. Look up 'Sage Pia' in Google

Ananya Appan

This author has not been identified. Look up 'Ananya Appan' in Google

Maryam Rezapour

This author has not been identified. Look up 'Maryam Rezapour' in Google

Amey Shukla

This author has not been identified. Look up 'Amey Shukla' in Google

Nikhil Date

This author has not been identified. Look up 'Nikhil Date' in Google

Benjamin Fuller 0001

This author has not been identified. Look up 'Benjamin Fuller 0001' in Google

Ling Ren 0001

This author has not been identified. Look up 'Ling Ren 0001' in Google

David Heath

This author has not been identified. Look up 'David Heath' in Google